登入選單
返回Google圖書搜尋
Polytopes - Combinations and Computation
Gil KalaiGünter M. Ziegler
出版Springer Science & Business Media, 2000-08-01
主題Mathematics / Geometry / General
ISBN37643635179783764363512
URLhttp://books.google.com.hk/books?id=-jtadMIhPGoC&hl=&source=gbs_api
EBookSAMPLE
註釋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.