Overview
- Editors:
-
-
Gil Kalai
-
Institute of Mathematics and Computer Science, The Hebrew University, Jerusalem, Israel
-
Günter M. Ziegler
-
Fachbereich Mathematik MA 7-1, Technische Universität Berlin, Berlin, Germany
Access this book
Other ways to access
Table of contents (10 chapters)
-
-
-
- Ewgenij Gawrilow, Michael Joswig
Pages 43-73
-
- Gil Kalai, Peter Kleinschmidt, Günter Meisinger
Pages 75-103
-
- Andrea Höppner, Günter M. Ziegler
Pages 105-110
-
-
- Benno Büeler, Andreas Enge, Komei Fukuda
Pages 131-154
-
- Hans Achatz, Peter Kleinschmidt
Pages 155-165
-
-
-
About this book
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.
Editors and Affiliations
-
Institute of Mathematics and Computer Science, The Hebrew University, Jerusalem, Israel
Gil Kalai
-
Fachbereich Mathematik MA 7-1, Technische Universität Berlin, Berlin, Germany
Günter M. Ziegler