Item description for Polytopes - Combinatorics and Computation (Oberwolfach Seminars) by Gil Kalai & G. M. Ziegler...
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.
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Est. Packaging Dimensions: Length: 0.5" Width: 6.5" Height: 9.25" Weight: 1 lbs.
Release Date Sep 6, 2000
Publisher Birkhäuser Basel
ISBN 3764363517 ISBN13 9783764363512
Availability 112 units. Availability accurate as of Feb 21, 2017 01:52.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.