The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4
From MaRDI portal
Publication:3906725
DOI10.1287/moor.5.4.599zbMath0457.52006OpenAlexW2058444378WikidataQ123194438 ScholiaQ123194438MaRDI QIDQ3906725
Publication date: 1980
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.5.4.599
(n)-dimensional polytopes (52B11) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05)
Related Items (13)
Recent progress on the combinatorial diameter of polytopes and simplicial complexes ⋮ Monotone diameter of bisubmodular polyhedra ⋮ A counterexample to the Hirsch conjecture ⋮ A proof of the strict monotone 5-step conjecture ⋮ The worst-case running time of the random simplex algorithm is exponential in the height ⋮ Polyhedral aspects of discrete optimization ⋮ The monotonic diameter of the perfect matching and shortest path polytopes ⋮ Signature classes of transportation polytopes ⋮ Monotone paths in geometric triangulations ⋮ Computing monotone disjoint paths on polytopes ⋮ Monotone Paths in Planar Convex Subdivisions and Polytopes ⋮ Adjacency on combinatorial polyhedra ⋮ On the Length of Monotone Paths in Polyhedra
This page was built for publication: The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4
