A Continuous d-Step Conjecture for Polytopes
Open Access
- 1 July 2008
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 41 (2) , 318-327
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes2009
- Polytopes and arrangements: Diameter and curvatureOperations Research Letters, 2008
- On the Curvature of the Central Path of Linear Programming TheoryFoundations of Computational Mathematics, 2005
- Convex Polytopes2003
- A Mathematical View of Interior-Point Methods in Convex Optimization2001
- More polytopes meeting the conjectured Hirsch boundDiscrete Mathematics, 1999
- Many Polytopes Meeting the Conjectured Hirsch BoundDiscrete & Computational Geometry, 1998
- A quasi-polynomial bound for the diameter of graphs of polyhedraBulletin of the American Mathematical Society, 1992
- On the complexity of following the central path of linear programs by linear extrapolation IIMathematical Programming, 1991
- The d-step conjecture for polyhedra of dimension d<6Acta Mathematica, 1967