Polytopes - Combinations and Computation

Günter M. Ziegler

ISBN 10: 3764363517 / ISBN 13: 9783764363512

Published by Birkhäuser Basel, Springer Basel Aug 2000, 2000

About this Item

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. 232 pp. Englisch.

Seller Inventory # 9783764363512

Bibliographic Details

• Title: Polytopes - Combinations and Computation
• Publisher: Birkhäuser Basel, Springer Basel Aug 2000
• Publication Date: 2000
• Language: English
• ISBN 10: 3764363517
• ISBN 13: 9783764363512
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 240W x 170H x 13D millimeters 240 millimeters width by 170 millimeters height by 13 millimeters depth
• Weight: 402 grams

About this title

Synopsis

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.

Synopsis

Questions that arose from linear programming and combinatorial optimization have been a driving force for modern polytope theory. The papers of this volume display a wide panorama of connections of polytope theory with other fields.