Polytopes — Combinatorics and Computation / edited by Gil Kalai, Günter M. Ziegler
(DMV Seminar ; 29)
| データ種別 | 電子ブック |
|---|---|
| 出版者 | Basel : Birkhäuser Basel : Imprint: Birkhäuser |
| 出版年 | 2000 |
| 本文言語 | 英語 |
| 大きさ | VI, 225 p. 14 illus : online resource |
書誌詳細を非表示
| 内容注記 | Lectures on 0/l-Polytopes polymake: A Framework for Analyzing Convex Polytopes Flag Numbers and FLAGTOOL A Census of Flag-vectors of 4-Polytopes Extremal Properties of 0/1-Polytopes of Dimension 5 Exact Volume Computation for Polytopes: A Practical Study Reconstructing a Simple Polytope from its Graph Reconstructing a Non-simple Polytope from its Graph A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm The Complexity of Yamnitsky and Levin’s Simplices Method |
|---|---|
| 一般注記 | 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 |
| 著者標目 | Kalai, Gil editor Ziegler, Günter M. editor SpringerLink (Online service) |
| 件 名 | LCSH:Mathematics LCSH:Geometry FREE:Mathematics FREE:Geometry |
| 分 類 | DC23:516 |
| 巻冊次 | ISBN:9783034884389 
|
| ISBN | 9783034884389 |
| URL | http://dx.doi.org/10.1007/978-3-0348-8438-9 |
目次／あらすじ