George Dantzig's impact on the theory of computation
From MaRDI portal
(Redirected from Publication:951091)
Recommendations
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3648423 (Why is no real title available?)
- scientific article; zbMATH DE number 3121287 (Why is no real title available?)
- scientific article; zbMATH DE number 3121292 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- scientific article; zbMATH DE number 3548722 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3614497 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1241836 (Why is no real title available?)
- scientific article; zbMATH DE number 2061763 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3302127 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- scientific article; zbMATH DE number 3069632 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- A quasi-polynomial bound for the diameter\\of graphs of polyhedra
- A randomized polynomial-time simplex algorithm for linear programming
- A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
- A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps
- A strongly polynomial minimum cost circulation algorithm
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
- Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- On the average number of steps of the simplex method of linear programming
- On the shortest route through a network
- Outline of an algorithm for integer solutions to linear programs
- PRIMES is in P
- Paths, Trees, and Flowers
- Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
- Smoothed analysis of algorithms
- Solution of a Large-Scale Traveling-Salesman Problem
- The complexity of theorem-proving procedures
Cited in
(6)- George B. Dantzig: a legendary life in mathematical programming
- An extension of the fundamental theorem of linear programming
- Novel interior point algorithms for solving nonlinear convex optimization problems
- George B. Dantzig and systems optimization
- A linear programming primer: from Fourier to Karmarkar
- CLOUD computing risk management for server-farm repair rates, consumer load cycle, server-farm repair crew count, and additional servers
This page was built for publication: George Dantzig's impact on the theory of computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q951091)
