Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm

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

Journal of the ACM (JACM)

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

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing

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

Journal of the ACM (JACM)

Nash Equilibria in Random Games

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science

Improved Smoothed Analysis of the Shadow Vertex Simplex Method

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science

Linear programming

Algorithms and theory of computation handbook

Algorithm engineering: bridging the gap between algorithm theory and practice

Algorithm engineering: bridging the gap between algorithm theory and practice

George Dantzig's impact on the theory of computation

Discrete Optimization