A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension (1985)

Cached

Download Links

by Ilan Adler , Nimrod Megiddo
Venue:JOURNAL OF THE ACM
Citations:30 - 2 self

Documents Related by Co-Citation

170 How good is the simplex algorithm – V Klee, G Minty - 1969
51 The simplex method: a probabilistic analysis. Number 1 in Algorithms and Combinatorics – K H Borgwardt - 1980
23 Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems – M J Todd - 1986
17 The simplex algorithm is very good!: On the expected number of pivot steps and related properties of random linear programs – M Haimovich - 1983
33 On the average number of steps of the simplex method of linear programming – S Smale - 1983
52 A quasi-polynomial bound for the diameter of graphs of polyhedra – Gil Kalai, Daniel J. Kleitman - 1992
798 Linear Programming and Extensions – G B Dantzig - 1963
379 A polynomial algorithm in linear programming – Leonid Khachiyan - 1979
16 The expected number of pivots needed to solve parametric linear programs and the efficiency of the self-dual simplex method – I Adler - 1983
18 The computational algorithm for the parametric objective function – S Gass, T Saaty - 1955
9 Untersuchungen zur Asymptotik der mittleren Schrittzahl von Simplexverfahren in der linearen Optimierung – Karl Heinz Borgwardt - 1977
15 The problem of the average speed of the simplex method – S Smale - 1982
13 Worst case complexity of the shadow vertex simplex algorithm – D Goldfarb - 1983
9 IMPROVED ASYMPTOTIC ANALYSIS OF THE AVERAGE NUMBER OF STEPS PERFORMED BY THE SELF-DUAL SIMPLEX ALGORITHM – Nimrod Megiddo - 1986
198 A new polynomial time algorithm for linear programming – N Karmarkar - 1984
87 Linear Programming, Complexity Theory and Elementary Functional Analysis – James Renegar - 1995
20 Probabilistic models for linear programming – M Todd - 1991
51 Incorporating Condition Measures Into The Complexity Theory Of Linear Programming – James Renegar - 1995
72 Some Perturbation Theory for Linear Programming – James Renegar - 1992