Randomized simplex algorithms on Klee-Minty cubes

Combinatorica

Volumn 18, Issue 3, 1998, Pages 349-372

  Gärtner, Bernd ^a   Henk, Martin ^b   Ziegler, Günter M ^b  

^a ETH ZURICH   (Switzerland)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032437764     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009827     Document Type: Article

References (35)

1. N. AMENTA and G. M. ZIEGLER: Deformed products and maximal shadows, in: Advances in Discrete and Computational Geometry (B. Chazelle, J.E. Goodman, R. Pollack, eds.), Contemporary Mathematics (1998), Amer. Math. Soc., Providence, in print.
2. D. AVIS and V. CHVÁTAL: Notes on Bland's pivoting rule, in: Polyhedral Combinatorics (M. L. Balinski, A. J. Hoffmann, eds.), Math. Programming Study 8 (1978), 24-34.
3. R. G. BLAND: New finite pivoting rules for the simplex method, Math. Operations Research, 2 (1977), 103-107.
4. K. H. BORGWARDT: The Simplex Method. A Probabilistic Analysis, Algorithms and Combinatorics 1, Springer Verlag, Berlin, 1987.
5. M. BOUSQUET-MÉLOU: The number and average length of decreasing paths in the Klee-Minty cube, Manuscript, 1996.
6. A. Z. BRODER, M. E. DYER, A. M. FRIEZE, P. RAGHAVAN and E. UPFAL: The worst-case running time of the random simplex algorithm is exponential in the height, Information Processing Letters 56 (1995), 79-81.
7. H. BRUGGESSER and P. MANI: Shellable decompositions of cells and spheres, Math. Scand. 29 (1971), 197-205.
8. G. B. DANTZIG: Linear Programming and Extensions, Princeton University Press, Princeton, 1963.
9. B. GÄRTNER: Combinatorial Linear Programming: Geometry Can Help, in: Proc. 2nd. International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), Barcelona, 1998, Lecture Notes in Computer Science, bf 1518, 82-96.
10. B. GÄRTNER: Randomized Optimization by Simplex Type Methods, Ph.D. Thesis, Freie Universität Berlin, 1995.
11. B. GÄRTNER and G. M. ZIEGLER: Randomized simplex algorithms on Klee-Minty cubes, in: Proc. 35th Annual Symposium on Foundations of Computer Science (FOCS), November 20-22, 1994, Santa Fe NM, IEEE Press, Los Alamitos 1994, 502-510.
12. D. GOLDFARB: Worst case complexity of the shadow vertex simplex algorithm, preprint, Columbia University 1983, 11 pages; published in: D. GOLDFARB: On the complexity of the simplex algorithm, in: Advances in optimization and numerical analysis, (S. Gomez, ed.), Kluwer, Dordrecht 1994, 25-38.
13. D. GOLDFARB: Worst case complexity of the shadow vertex simplex algorithm, preprint, Columbia University 1983, 11 pages; published in: D. GOLDFARB: On the complexity of the simplex algorithm, in: Advances in optimization and numerical analysis, (S. Gomez, ed.), Kluwer, Dordrecht 1994, 25-38.
14. M. GOLDWASSER: A survey of linear programming in randomized subexponential time, ACM-SIGACT News 26 (1995), 96-104.
15. R. L. GRAHAM, D. E. KNUTH and O. PATASHNIK: Concrete Mathematics, Addison-Wesley, Reading, MA, 1989.
16. B. GRÜNBAUM: Convex Polytopes, Interscience, London, 1967.
17. G. KALAI: A subexponential randomized simplex algorithm, in: Proc. 24th ACM Symposium on the Theory of Computing (STOC), ACM Press 1992, 475-482.
18. G. KALAI and D. J. KLEITMAN: A quasi-polynomial bound for the diameter of graphs of polyhedra, Bulletin Amer. Math. Soc. 26 (1992), 315-316.
19. D. G. KELLY: Some results on random linear programs, Methods of Operations Research 40 (1981), 351-355.
20. V. KLEE: Paths on polyhedra II, Pacific Journal of Mathematics 17 (1966), 249-262.
21. V. KLEE and P. KLEINSCHMIDT: The d-step conjecture and its relatives, Math. Operations Research 12 (1987), 718-755.
22. V. KLEE and P. KLEINSCHMIDT: Geometry of the Gass-Saaty parametric cost LP algorithm, Discrete Comput. Geometry 5 (1990), 13-26.
23. V. KLEE and G. J. MINTY: How good is the simplex algorithm?, in: Inequalities III (O. Sisha, ed.), Academic Press, New York, 1972, 159-175.
24. D. G. LARMAN: Paths on polytopes, Proc. London Math. Soc. 20 (1970), 161-178.
25. J. MATOUŠEK: Lower bounds for a subexponential optimization algorithm, Random Structures and Algorithms, 5 (1994), 591-607.
26. J. MATOUŠEK, M. SHARIR and E. WELZL: A subexponential bound for linear programming, Algorithmica 16 (1996), 498-516.
27. P. MCMULLEN: The maximum numbers of faces of a convex polytope, Mathematika 17 (1970), 179-184.
28. N. MEGIDDO: Linear programming in linear time when the dimension is fixed, J. ACM 31 (1984), 114-127.
29. K. G. MURTY: Computational complexity of parametric linear programming, Math. Programming 19 (1980), 213-219.
30. C. H. PAPADIMITRIOU and K. STEIGLITZ: Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Inc., Englewood Cliffs, NJ, 1982.
31. A. SCHRIJVER: Theory of Linear and Integer Programming, Wiley-Interscience, Chichester, 1986.
32. R. SHAMIR: The efficiency of the simplex method: a survey, Management Sci. 33 (1987), 301-334.
33. K. WILLIAMSON HOKE: Completely unimodal numberings of a simple polytope, Discrete Applied Math. 20 (1988), 69-81.
34. N. ZADEH: What is the worst case behavior of the simplex algorithm?, Technical Report No. 27, Dept. Operations Research, Stanford, 1980, 26 pages.
35. G. M. ZIEGLER: Lectures on Polytopes, Graduate Texts in Mathematics 152, Springer-Verlag, New York, 1995.