Shamir, R. (1987), The efficiency of the simplex method: A survey, Manage. Sci. 33, 301-334.

Sharir, M., and E. Welzl (1992), A combinatorial bound for linear programming and related problems, in Proc. 9th Symposium on the Theoretical Aspects of Computer Science, Lecture Notes in Computer Science no. 577, Springer-Verlag, New York, 569-579.

Smale, S. (1983a), On the average speed of the simplex method of linear programming, Math. Programming 27, 241-262.

Smale, S. (1983b), The problem of the average speed of the simplex method, in Mathematical Programming: The State of the Art, A. Bachem, M. Gröt-schel, and B. Korte, eds., Springer-Verlag, Berlin, 530-539.

Todd, M.J. (1986), Polynomial expected behavior of a pivoting algorithm for linear complementary and linear programming problems, Math. Programming 35, 173-192.

Todd, M.J. (1991), Probabilistic models for linear programming, Math. Oper. Res. 16, 671-693.

Welzl, E. (1991), Smallest enclosing disks (balls and ellipsoids), in New Results and New Trends in Computer Science, H. Maurer, ed., Lecture Notes in Computer Science no. 555, Springer-Verlag, New York, 359-370.

The National Academies | 500 Fifth St. N.W. | Washington, D.C. 20001
Copyright © National Academy of Sciences. All rights reserved.
Terms of Use and Privacy Statement