Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 296-305

  Spielman, D A ^a   Teng, S H ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; PERTURBATION TECHNIQUES; POLYNOMIALS; VECTORS;

SIMPLEX ALGORITHMS; SMOOTHED ANALYSIS;

ALGORITHMS;

EID: 0034819504     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. 2)) expected number of pivot steps
2. A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
3. Notes on Bland's pivoting rule
4. Integralgeometrie 2: Zu ergebnissen von m. w. crofton
5. The Simplex Method: A probabilistic analysis
6. Maximization of linear function of variables subject to linear inequalities
7. Eigenvalue roulette and random test matrices
8. The computational algorithm for the parametric objective function
9. Worst case behaviour of the steepest edge simplex method
10. The simplex algorithm with the pivot rule of maximizing improvement criterion
11. A subexponential randomized simplex algorithm
12. A quasi-polynomial bound for the diameter of graphs of polyhedra
13. A new polynomial time algorithm for linear programming
14. A polynomial algorithm in linear programming
15. How good is the simplex algorithm ?
16. A subexponential bound for linear programming
17. Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm
18. Isotropic random simplices
19. Computational complexity of parametric linear programming
20. Encyclopedia of mathematics and its applications
21. The problem of the average speed of the simplex method
22. On the average number of steps in the simplex method of linear programming
23. Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems