標(biāo)題: Titlebook: Degeneracy Graphs and the Neighbourhood Problem; H.-J. Kruse Book 1986 Springer-Verlag Berlin Heidelberg 1986 algorithms.graph theory.line [打印本頁] 作者: Malevolent 時(shí)間: 2025-3-21 16:33
書目名稱Degeneracy Graphs and the Neighbourhood Problem影響因子(影響力)
書目名稱Degeneracy Graphs and the Neighbourhood Problem影響因子(影響力)學(xué)科排名
書目名稱Degeneracy Graphs and the Neighbourhood Problem網(wǎng)絡(luò)公開度
書目名稱Degeneracy Graphs and the Neighbourhood Problem網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Degeneracy Graphs and the Neighbourhood Problem被引頻次
書目名稱Degeneracy Graphs and the Neighbourhood Problem被引頻次學(xué)科排名
書目名稱Degeneracy Graphs and the Neighbourhood Problem年度引用
書目名稱Degeneracy Graphs and the Neighbourhood Problem年度引用學(xué)科排名
書目名稱Degeneracy Graphs and the Neighbourhood Problem讀者反饋
書目名稱Degeneracy Graphs and the Neighbourhood Problem讀者反饋學(xué)科排名
作者: 注視 時(shí)間: 2025-3-21 20:48 作者: 壯觀的游行 時(shí)間: 2025-3-22 00:36
Book 1986ery simple question has been posed: in the case an extreme- pOint (EP) of a polytope is degenerate and the task is to find all neighbouring EP‘s of the degenerate EP, is it necessary to determine all basic solutions of the corresponding equalities system associated with the degenerate EP -in order t作者: epinephrine 時(shí)間: 2025-3-22 04:47
A Method to Solve the Neighbourhood Problem,rate vertex has exactly one pivot tableau and all neighbouring vertices can be determined on the basis of this tableau in one pivot step each time. In contrast to this, a degenerate vertex x. is associated with different pivot tableaux, and in exceptional cases only can all neighbouring vertices be computed using just one pivot tableau of x..作者: 群島 時(shí)間: 2025-3-22 10:39 作者: Guaff豪情痛飲 時(shí)間: 2025-3-22 13:30 作者: Guaff豪情痛飲 時(shí)間: 2025-3-22 21:02
Degeneracy Graphs,for example possible to reduce the problem of determining all vertices of a convex polytope to the problem of determining a spanning tree. of the corresponding graph. Among other things, this approach is used in the procedures developed by MANAS/NEDOMA [1968] and DYER/PROLL [1977]. In their survey M作者: hidebound 時(shí)間: 2025-3-22 22:01 作者: 吝嗇性 時(shí)間: 2025-3-23 04:38
A Method to Solve the Neighbourhood Problem,olytope. In the following we call it the .. The determination of all neighbouring vertices of a .degenerate vertex is unproblematic, since a nondegenerate vertex has exactly one pivot tableau and all neighbouring vertices can be determined on the basis of this tableau in one pivot step each time. In作者: 騷動 時(shí)間: 2025-3-23 06:30 作者: 的闡明 時(shí)間: 2025-3-23 13:24
https://doi.org/10.1007/978-3-662-30016-9vertices of a degenerate vertex of a convex polytope .. In the above paper the structure of these special graphs (or subgraphs) is for the first time considered to be a theoretical object of investigation.作者: Fracture 時(shí)間: 2025-3-23 15:15
Introduction,he computational effort substantially depends upon the number and the individual degeneracy degree of the degenerate vertices which are (must be) determined with the help of such techniques. Therefore efficiency losses due to degeneracy have to be taken into account, especially in using pivoting met作者: 天氣 時(shí)間: 2025-3-23 20:04 作者: Prosaic 時(shí)間: 2025-3-24 02:14 作者: Gratuitous 時(shí)間: 2025-3-24 04:36
Book 1986hat such a graph has some special properties and in order to solve the above questions firstly these properties had to be investigated. Also the structure of degeneracy graphs playes hereby an important role. Because the theory of degeneracy graphs was quite new, it was necessary to elaborate first 作者: 縮影 時(shí)間: 2025-3-24 10:23
The Concept of Degeneracy, at least one vertex. Denote by X the solution set of the canonical form of (2.1).. Each basis B of the enlarged matrix P =(AüI) is also called a basis of (2.1) or of the canonical form. Tab. 2.1 shows the pivot tableau which is uniquely assigned to a basis B (and vice versa)..作者: 古董 時(shí)間: 2025-3-24 13:46 作者: achlorhydria 時(shí)間: 2025-3-24 15:01
Lecture Notes in Economics and Mathematical Systemshttp://image.papertrans.cn/d/image/264859.jpg作者: 分貝 時(shí)間: 2025-3-24 22:52 作者: 枕墊 時(shí)間: 2025-3-25 01:49 作者: AUGUR 時(shí)間: 2025-3-25 06:50
https://doi.org/10.1007/978-3-662-30016-9for example possible to reduce the problem of determining all vertices of a convex polytope to the problem of determining a spanning tree. of the corresponding graph. Among other things, this approach is used in the procedures developed by MANAS/NEDOMA [1968] and DYER/PROLL [1977]. In their survey M作者: 令人作嘔 時(shí)間: 2025-3-25 11:11 作者: 相信 時(shí)間: 2025-3-25 15:44 作者: 注意到 時(shí)間: 2025-3-25 16:28
https://doi.org/10.1007/978-3-642-49270-9algorithms; graph theory; linear optimization; sensitivity analysis作者: 大罵 時(shí)間: 2025-3-25 21:22 作者: ALE 時(shí)間: 2025-3-26 00:31
Degeneracy Graphs and the Neighbourhood Problem978-3-642-49270-9Series ISSN 0075-8442 Series E-ISSN 2196-9957 作者: 挑剔小責(zé) 時(shí)間: 2025-3-26 05:32
https://doi.org/10.1007/978-3-662-30016-9 at least one vertex. Denote by X the solution set of the canonical form of (2.1).. Each basis B of the enlarged matrix P =(AüI) is also called a basis of (2.1) or of the canonical form. Tab. 2.1 shows the pivot tableau which is uniquely assigned to a basis B (and vice versa)..作者: 無聊點(diǎn)好 時(shí)間: 2025-3-26 11:00 作者: 有組織 時(shí)間: 2025-3-26 15:15
Chemosensory Orientation Mechanisms of Fishyoung host plants in these nurseries. Despite its excellent growth on seedlings of many tree species, it is less common in experimental studies than many other species described in this book. However, its rather special ecological role makes it an interesting species for experimental work.作者: neutralize 時(shí)間: 2025-3-26 19:44 作者: 織物 時(shí)間: 2025-3-26 21:02 作者: BULLY 時(shí)間: 2025-3-27 03:42
Wolfgang Paulitional – zu einer verbindlichen Konventionentwickelt. In diesem Kontext werden neueste Erkenntnisse und Trends?für die Anwendung der Methode BIM in der Praxis in den Gewerken Trinkwasser, Energie und Brandschutz reflektiert sowie?auch die rechtlichen Aspekte zukunftsweisend erl?utert..作者: 四目在模仿 時(shí)間: 2025-3-27 06:42 作者: offense 時(shí)間: 2025-3-27 10:52
Baal,rect defences against the harsh realities of life; in the hands of the strong ideals were a means of exploiting the weak, a task which was ironically made easier by the need felt by the weak for ideals to prop up their crumbling lives:作者: 隨意 時(shí)間: 2025-3-27 16:33
https://doi.org/10.1007/978-1-4615-4655-9data mining; design; logistics; maintainability; maintenance; optimization; quality; reliability; quality co作者: inconceivable 時(shí)間: 2025-3-27 18:32
