On the diameter of convex polytopes

DOI10.1016/0012-365X(92)90349-KzbMath0762.52004MaRDI QIDQ1193432

Peter Kleinschmidt, Shmuel Onn

Publication date: 27 September 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

estimatesdiameter of convex polytopes

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Inequalities and extremum problems in real or complex geometry (51M16)

Related Items

Improving bounds on the diameter of a polyhedron in high dimensions, On the diameter of lattice polytopes, Lattice-free polytopes and their diameter, Distance between vertices of lattice polytopes, Recent progress on the combinatorial diameter of polytopes and simplicial complexes, Determination of social laws for multi-agent mobilization, The diameter of lattice zonotopes, On the Combinatorial Diameters of Parallel and Series Connections, A scaling algorithm for optimizing arbitrary functions over vertices of polytopes, On Dantzig figures from graded lexicographic orders, Improved bounds on the diameter of lattice polytopes, Geometry, complexity, and combinatorics of permutation polytopes, Primitive zonotopes, Computational determination of the largest lattice polytope diameter, Elementary moves on lattice polytopes, An asymptotically improved upper bound on the diameter of polyhedra, Graphs of transportation polytopes, A Generalized Simplex Method for Integer Problems Given by Verification Oracles, The maximum clique problem, Short simplex paths in lattice polytopes

Cites Work

• Unnamed Item
• The Hirsch conjecture is true for (0,1)-polytopes
• Note on Independence Functions
• The d-Step Conjecture and Its Relatives
• Matroids and the greedy algorithm