Polytopes - Combinations and Computation

Gil Kalai

ISBN 10: 3764363517 / ISBN 13: 9783764363512

Verlag: Springer, Basel, Birkhäuser Basel, Birkhäuser Aug 2000, 2000

Beschreibung

This item is printed on demand - it takes 3-4 days longer - Neuware -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. 225 pp. Englisch.

Bestandsnummer des Verkäufers 9783764363512

Bibliografische Details

• Titel: Polytopes - Combinations and Computation
• Verlag: Springer, Basel, Birkhäuser Basel, Birkhäuser Aug 2000
• Erscheinungsjahr: 2000
• Sprache: Englisch
• ISBN-10: 3764363517
• ISBN-13: 9783764363512
• Einband: Taschenbuch
• Zustand: Neu
• Abmessungen: 240B x 170 H x 13 T Millimeter Breite: 240 mm, Höhe: 170 mm, Tiefe: 13 mm
• Gewicht: 398 Gramm

Über diesen Titel

Inhaltsangabe

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.