検索結果をRefWorksへエクスポートします。対象は1件です。
Export
RT Book, Whole SR Electronic DC OPAC T1 Polytopes — Combinatorics and Computation / edited by Gil Kalai, Günter M. Ziegler T2 DMV Seminar A1 Kalai, Gil A1 Ziegler, Günter M. A1 SpringerLink (Online service) YR 2000 FD 2000 SP VI, 225 p. 14 illus K1 Mathematics K1 Geometry K1 Mathematics K1 Geometry PB Birkhäuser Basel : Imprint: Birkhäuser PP Basel SN 9783034884389 LA English (英語) CL DC23:516 NO Questions that arose from linear programming and combinatorial optimization have been a driving force for modern polytope theory, such as the diameter questions motivated by the desire to understand the complexity of the simplex algorithm, or the need to study facets for use in cutting plane procedures. In addition, algorithms now provide the means to computationally study polytopes, to compute their parameters such as flag vectors, graphs and volumes, and to construct examples of large complexity. The papers of this volume thus display a wide panorama of connections of polytope theory with other fields. Areas such as discrete and computational geometry, linear and combinatorial optimization, and scientific computing have contributed a combination of questions, ideas, results, algorithms and, finally, computer programs NO 書誌ID=1002995370; LK [E Book]http://dx.doi.org/10.1007/978-3-0348-8438-9 OL 30