Certification of an optimal TSP tour through 85,900 cities

Operations Research Letters

Volumn 37, Issue 1, 2009, Pages 11-15

  Applegate, David L ^a   Bixby, Robert E ^b   Chvátal, Vašek ^c   Cook, William ^d   Espinoza, Daniel G ^e   Goycoolea, Marcos ^f   Helsgaun, Keld ^g  

^a AT AND T LABS RESEARCH   (United States)

^b RICE UNIVERSITY   (United States)

^c Gina Cody School of Engineering and Computer Science   (Canada)

^d Georgia Institute of Technology   (United States)

^e UNIVERSITY OF CHILE   (Chile)

^f UNIVERSIDAD ADOLFO IBÁÑEZ   (Chile)

^g ROSKILDE UNIVERSITY   (Denmark)

Author keywords

Integer programming; Linear programming; Traveling salesman problem

Indexed keywords

DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; LINEARIZATION; PARTICLE SIZE ANALYSIS; PROBLEM SOLVING;

CHALLENGE PROBLEMS; COMPUTER CODES; OPTIMALITY;

TRAVELING SALESMAN PROBLEM;

EID: 58049122137     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2008.09.006     Document Type: Article

References (20)

1. Applegate D., Bixby R.E., Chvátal V., and Cook W. Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Math. Program. 97 (2003) 91-153
2. Applegate D., Bixby R.E., Chvátal V., and Cook W. The Traveling Salesman Problem: A Computational Study (2006), Princeton University Press, Princeton, New Jersey, USA
3. D. Applegate, R.E. Bixby, V. Chvátal, W. Cook, Concorde. Available at: www.tsp.gatech.edu
4. Boyd S.C., and Cunningham W.H. Small travelling salesman polytopes. Math. Oper. Res. 16 (1991) 259-271
5. Chvátal V. Edmonds polytopes and weakly hamiltonian graphs. Math. Program. 5 (1973) 29-40
6. J.-M. Clochard, D. Naddef, Using path inequalities in a branch and cut code for the symmetric traveling salesman problem, G. Rinaldi, L. Wolsey (Eds.), Third IPCO Conference, 1993, pp. 291-311
7. Dantzig G., Fulkerson R., and Johnson S. Solution of a large-scale traveling-salesman problem. Oper. Res. 2 (1954) 393-410
8. Fleischmann B. A new class of cutting planes for the symmetric traveling salesman problem. Math. Program. 40 (1988) 225-246
9. Grötschel M., and Padberg M.W. On the symmetric traveling salesman problem I: Inequalities. Math. Program. 16 (1979) 265-280
10. Grötschel M., and Pulleyblank W.R. Clique tree inequalities and the symmetric traveling salesman problem. Math. Oper. Res. 11 (1986) 537-569
11. Held M., and Karp R.M. The traveling-salesman problem and minimum spanning trees: Part II. Math. Program. 1 (1971) 6-25
12. K. Helsgaun, An effective implementation of K-opt moves for the Lin-Kernighan TSP heuristic, Writings on Computer Science, No. 109, Roskilde University, 2006
13. K. Helsgaun, LKH 2. Available at: http://www.akira.ruc.dk/~keld/research/LKH/
14. S. Hong, A Linear Programming Approach for the Traveling Salesman Problem, Ph.D. Thesis, The Johns Hopkins University, Baltimore, Maryland, USA, 1972
15. Kernighan B.W., and Ritchie D.M. The C Programming Language (1978), Prentice Hall, Englewood Cliffs, New Jersey, USA
16. Letchford A.N. Separating a superclass of comb inequalities in planar graphs. Math. Oper. Res. 25 (2000) 443-454
17. Naddef D., and Rinaldi G. The symmetric traveling salesman polytope: New facets from the graphical relaxation. Math. Oper. Res. 32 (2006) 233-256
18. Padberg M., and Rinaldi G. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33 (1991) 60-100
19. G. Reinelt, TSPLIB95, Interdisziplinäres Zentrum für Wissenschaftliches Rechnen (IWR), Heidelberg, 1995
20. M. Trick, Is most published operations research false? Michael Trick's Operations Research Blog. http://www.mat.tepper.cmu.edu/blog/?p=152