George Dantzig's contributions to integer programming

Discrete Optimization

Volumn 5, Issue 2, 2008, Pages 168-173

  Grötschel, Martin ^a   Nemhauser, George L ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b Georgia Institute of Technology   (United States)

Author keywords

History of integer programming; Traveling salesman problem

Indexed keywords

NUMERICAL METHODS; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

HISTORY OF INTEGER PROGRAMMING; SEMINAL WORK;

INTEGER PROGRAMMING;

EID: 41149154520     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2007.08.003     Document Type: Article

References (18)

1. Applegate D.L., Bixby R.E., Chvátal V., and Cook W.J. The Traveling Salesman Problem: A Computational Study (2006), Princeton University Press 606 pp
2. Bowman V.J., and Nemhauser G.L. A finiteness proof for modified Dantzig cuts in integer programming. Naval Research Logistics Quarterly 17 (1969) 309-313
3. Chvátal V. Edmonds polytopes and weakly Hamiltonian graphs. Mathematical Programming 5 (1973) 29-40
4. Dantzig G.B. Discrete variable extremum problems. Operations Research 5 (1957) 266-277
5. Dantzig G.B. On the significance of solving linear programs with some integer variables. Econometrica 28 (1960) 30-34
6. G.B. Dantzig, D.R. Fulkerson, S. Johnson, Solution of a large scale traveling salesman problem, The Rand Corporation, P-510, 12 April 1954
7. Dantzig G.B., Fulkerson D.R., and Johnson S. Solution of a large scale traveling salesman problem. Operations Research 2 (1954) 393-410
8. Dantzig G.B., Fulkerson D.R., and Johnson S. On a linear programming combinatorial approach to the traveling salesman problem. Operations Research 7 (1959) 58-66
9. Gomory R.E. Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society 64 (1958) 275-278
10. Gomory R.E., and Hoffman A.J. On the convergence of an integer programming process. Naval Research Logistics Quarterly 10 (1963) 121-123
11. Gomory R.E., and Hu T.C. Multi-terminal network flows. SIAM Journal of Applied Mathematics 9 (1961) 551-556
12. Grötschel M., Lovász L., and Schrijver A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 (1981) 167-197
13. Grötschel M., and Padberg M.W. On the symmetric travelling salesman problem I: Inequalities. Mathematical Programming 16 (1979) 281-302
14. I. Heller, On the Traveling Salesman Problem, in: Proc. 2nd Symp. on Linear Programming, 2, 1955, pp. 643-665
15. S. Hong, A linear programming approach for the travelling salesman problem, Ph.D. Thesis. The Johns Hopkins University, Baltimore, USA, 1972
16. Kuhn H.W. On certain convex polyhedra. Bulletin of the American Mathematical Society 61 (1955) 557-558
17. Naddef D. Polyhedral theory and branch-and-cut algorithms for the symmetric TSP. In: Gutin G., and Punnen A.P. (Eds). The Traveling Salesman Problem and its Variations (2002), Kluwer 29-116 (Chapter 2)
18. Padberg M.W., and Hong S. On the symmetric travelling salesman problem: A computational study. Mathematical Programming Study 12 (1980) 78-107