Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Polytopes - Combinations and Computation

Polytopes - Combinations and Computation

Kalai, Gil
Ziegler, Günter M.

Paperback

Series: Oberwolfach Seminars, Book 29

General ComputersGeneral MathematicsGeometry

ISBN10: 3764363517
ISBN13: 9783764363512
Publisher: Springer Nature
Published: Aug 1 2000
Pages: 225
Weight: 1.02
Height: 0.65 Width: 6.72 Depth: 9.44
Language: English
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.

Also in

Geometry

View All