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.
Gawrilow, E., & Joswig, M. (2000). polymake: a Framework for Analyzing Convex Polytopes. In Polytopes — Combinatorics and Computation (pp. 43–73). Birkhäuser Basel. https://doi.org/10.1007/978-3-0348-8438-9_2