Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems

Combinatorial complexity of the central curve

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

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

Interior-point methods: worst case and average case analysis of a phase-I algorithm and a termination procedure

Journal of Complexity

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

Journal of the ACM (JACM)

A quantitative measure for telecommunications networks topology design

IEEE/ACM Transactions on Networking (TON)

Anstreicher-Terlaky type monotonic simplex algorithms for linear feasibility problems

Optimization Methods & Software

Conjugate gradient method for the linear complementarity problem with S-matrix

Mathematical and Computer Modelling: An International Journal

George Dantzig's impact on the theory of computation

Discrete Optimization

Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set

Operations Research Letters