About “Polytopes”
Explores questions from linear programming and combinatorial optimization that have driven modern polytope theory, including diameter questions tied to the complexity of the simplex algorithm and facets used in cutting plane procedures. The papers display connections between polytope theory and discrete and computational geometry, optimization, and scientific computing. 2000 paperback edition.
Book details
- First published
- 2000