Free Delivery Over $100
|
|
|||
|
||||
OverviewQuestions 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. Full Product DetailsAuthor: Gil Kalai , Günter M. ZieglerPublisher: Birkhauser Verlag AG Imprint: Birkhauser Verlag AG Edition: 2000 ed. Volume: 29 Weight: 0.443kg ISBN: 9783764363512ISBN 10: 3764363517 Pages: 225 Publication Date: 01 August 2000 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: In Print  This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsLectures on 0/l-Polytopes.- polymake: A Framework for Analyzing Convex Polytopes.- Flag Numbers and FLAGTOOL.- A Census of Flag-vectors of 4-Polytopes.- Extremal Properties of 0/1-Polytopes of Dimension 5.- Exact Volume Computation for Polytopes: A Practical Study.- Reconstructing a Simple Polytope from its Graph.- Reconstructing a Non-simple Polytope from its Graph.- A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm.- The Complexity of Yamnitsky and Levin's Simplices Method.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |
||||
