George Dantzig's impact on the theory of computation

Authors:
Richard M. Karp
Affiliations:
University of California at Berkeley, Berkeley, CA, United States and International Computer Science Institute, Berkeley, CA, United States
Venue:
Discrete Optimization
Year:
2008

Citing 14
Cited 1

A new polynomial-time algorithm for linear programming

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

Journal of the ACM (JACM)
A strongly polynomial minimum cost circulation algorithm

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

Mathematical Programming: Series A and B
Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems

Mathematical Programming: Series A and B
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
A simplex variant solving an m×d linear program in O(min(m2,d2)) expected number of pivot steps

Journal of Complexity
A subexponential randomized simplex algorithm (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Approximation algorithms

Approximation algorithms
Introduction to Linear Optimization

Introduction to Linear Optimization
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures

STOC '71 Proceedings of the 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)
A randomized polynomial-time simplex algorithm for linear programming

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing

An optimal deployable bandwidth aggregation system

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

George Dantzig created the simplex algorithm for linear programming, perhaps the most important algorithm developed in the 20th century. This paper traces a single historical thread: Dantzig's work on linear programming and its application and extension to combinatorial optimization, and the investigations it has stimulated about the performance of the simplex algorithm and the intrinsic complexity of linear programming and combinatorial optimization.