A refinement of Todd's bound for the diameter of a polyhedron
From MaRDI portal
Publication:1785425
DOI10.1016/j.orl.2015.07.001zbMath1408.52015OpenAlexW851449153MaRDI QIDQ1785425
Noriyoshi Sukegawa, Tomonari Kitahara
Publication date: 28 September 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2015.07.001
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Linear programming (90C05) Distance in graphs (05C12)
Related Items (2)
Improving bounds on the diameter of a polyhedron in high dimensions ⋮ An asymptotically improved upper bound on the diameter of polyhedra
Cites Work
- Recent progress on the combinatorial diameter of polytopes and simplicial complexes
- A counterexample to the Hirsch conjecture
- Linear programming, the simplex algorithm and simple polytopes
- The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
- The d-Step Conjecture and Its Relatives
- A quasi-polynomial bound for the diameter\\of graphs of polyhedra
- Lectures on Polytopes
- An Improved Kalai--Kleitman Bound for the Diameter of a Polyhedron
- Paths on Polyhedra. I
- Paths on Polytopes
- Diameters of Polyhedral Graphs
This page was built for publication: A refinement of Todd's bound for the diameter of a polyhedron