Geometry of the Gass-Saaty parametric cost LP algorithm
From MaRDI portal
Publication:1825128
DOI10.1007/BF02187776zbMath0683.90045OpenAlexW2004086384MaRDI QIDQ1825128
Victor Klee, Peter Kleinschmidt
Publication date: 1990
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131103
Related Items
On polyhedral projection and parametric programming, On the existence of certain smooth toric varieties, \(S\)-hypersimplices, pulling triangulations, and monotone paths, Degeneracy graphs: Theory and applications. An updated survey, Encounters with degeneracy: A personal view
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps
- Stabbing line segments
- Computational complexity of parametric linear programming
- The Average number of pivot steps required by the Simplex-Method is polynomial
- Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method
- Higher Order Independence in Matroids
