George Dantzig's contributions to integer programming

DOI10.1016/j.disopt.2007.08.003zbMath1179.90005OpenAlexW2072849752MaRDI QIDQ951090

Martin Grötschel, Nemhauser, George I.

Publication date: 29 October 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2007.08.003

zbMATH Keywords

traveling salesman problemhistory of integer programming

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Biographies, obituaries, personalia, bibliographies (01A70) History of operations research and mathematical programming (90-03)

Related Items

A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings, “Make no little plans”: Impactful research to solve the next generation of transportation problems, Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm, Computing in combinatorial optimization, Light on the infinite group relaxation. I: Foundations and taxonomy

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• The ellipsoid method and its consequences in combinatorial optimization
• On the symmetric travelling salesman problem II: Lifting theorems and facets
• Outline of an algorithm for integer solutions to linear programs
• On the Significance of Solving Linear Programming Problems with Some Integer Variables
• Multi-Terminal Network Flows
• On the symmetric travelling salesman problem: A computational study
• Solution of a Large-Scale Traveling-Salesman Problem
• Discrete-Variable Extremum Problems
• On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem
• A finiteness proof for modified dantzig cuts in integer programming
• Edmonds polytopes and weakly hamiltonian graphs
• On the convergence of an integer‐programming process