ENGLISH

Polytopes — Combinatorics and Computation

By Günter M. Ziegler (eds.) , Günter M. Ziegler (auth.) , Gil Kalai

Book information

Publisher
Birkhäuser Basel
Year
2000
ISBN
978-3-7643-6351-2, 978-3-0348-8438-9
DOI
10.1007/978-3-0348-8438-9
Language
english
Format
PDF
Filesize
16 MB (16315534 bytes)
Series
DMV Seminar 29
Edition
1
Pages
225\227
Orientation
yes
Scanned
yes
Time added
2013-08-01 04:00:00
generalMathematics

Description

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.

Similar books