Polytopes - Combinatorics and Computation

Questions arising from linear programming and combinatorial optimization have been a driving force for modern polytope theory, and algorithms now provide the means to computationally study polytopes, to compute their parameters, and to construct examples of large complexity. This book explores a wide panorama of connections of polytope theory with other fields, such as discrete and computational geometry, linear and combinatorial optimization, and scientific computing, and presents a combination of questions, ideas, results, algorithms, and also computer programs.Kalai, Gil is the author of 'Polytopes - Combinatorics and Computation' with ISBN 9783764363512 and ISBN 3764363517.