Tour merging via branch-decomposition

INFORMS Journal on Computing

Volumn 15, Issue 3, 2003, Pages 233-248

  Cook, William ^a   Seymour, Paul ^b  

^a Georgia Institute of Technology   (United States)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

Combinatorial Optimization; Traveling Salesman Problem

Indexed keywords

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM; VECTORS;

BRANCH DECOMPOSITION; COMBINATORIAL OPTIMIZATION; GRAPH SEPARATORS;

DYNAMIC PROGRAMMING;

EID: 2042460404     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.15.3.233.16078     Document Type: Article

References (35)

1. Alon, N. 1986. Eigenvalues and expanders. Combinatorica 6 83-96.
2. Applegate, D., R. Bixby, V. Chvátal, W. Cook. 1995. Finding cuts in the TSP (a preliminary report). DIMACS Technical report 95-05, DIMACS, Rutgers University, New Brunswick, NJ.
3. Applegate, D., R. Bixby, V. Chvátal, W. Cook. 1998. On the solution of traveling salesman problems. Documenta Math. J. der Deutschen Mathematiker-Vereinigung, Internat. Congress of Math., 645-656.
4. Applegate, D., R. Bixby, V. Chvátal, W. Cook. 2001. TSP cuts which do not conform to the template paradigm. M. Jünger, D. Naddef, eds. Computational Combinatorial Optimization. Springer-Verlag, Heidelberg, Germany, 261-304.
5. Applegate, D., W. Cook, A. Rohe. 2003. Chained Lin-Kernighan for large traveling salesman problems. INFORMS J. on Comput. 15 82-92.
6. Arnborg, S., J. Lagergren, D. Seese. 1991. Easy problems for tree-decomposable graphs. J. Algorithms 12 308-340.
7. Balas, E., N. Simonetti. 2001. Linear time dynamic programming algorithms for some new classes of restricted TSPs: A computational study. INFORMS J. on Comput. 13 56-75.
8. Bern, M. W., E. L. Lawler, A. L. Wong. 1987. Linear time computation of optimal subgraphs of decomposable graphs. J. Algorithms 8 216-235.
9. Bodlaender, H. L. 1993. A tourist guide through treewidth. Acta Cybernetica 11 1-21.
10. Bodlaender, H. L. 1996. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. on Comput. 25 1305-1317.
11. Bodlaender, H. L. 1998. A partial k-arboretum of graphs with bounded treewidth. Theoretical Comput. Sci. 209 1-45.
12. Bodlaender, H. L., T. Kloks. 1996. Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms 21 358-402.
13. Bodlaender, H. L., D. M. Thilikos. 1997. Constructive linear time algorithms for branch-width. P. Degano, R. Gorrieri, A. Marchetti-Spaccamela, eds. Proc. 24th Internat. Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, no. 1256. Springer-Verlag, Berlin, Germany, 627-637.
14. Bodlaender, H. L., D. M. Thilikos. 1999. Graphs with branchwidth at most three. J. Algorithms 32 167-194.
15. Borie, R. B., R. G. Parker, C. A. Tovey. 1992. Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica 7 555-581.
16. Courcelle, B. 1990. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Informat. Comput. 85 12-75.
17. Helsgaun, K. 2000. An effective implementation of the LinKernighan traveling salesman heuristic. Eur. J. Oper. Res. 126 106-130. (The LKH code is available at http://www.dat.ruc.dk/~keld/research/LKH/.)
18. Hicks, I. V. 2000. Branch decompositions and their applications. Ph.D. thesis, Computational and Applied Mathematics, Rice University, Houston, TX.
19. Johnson, D. S. 1990. Local optimization and the traveling salesman problem. Proc. 17th Colloquium of Automata, Languages, and Programming, Lecture Notes in Computer Science, no. 443. Springer-Verlag, Berlin, Germany, 446-461.
20. Johnson, D. S., L. A. McGeoch. 1997. The traveling salesman problem: A case study in local optimization. E. H. L. Aarts, J. K. Lenstra, eds. Local Search in Combinatorial Optimization. John Wiley & Sons, New York, 215-310.
21. Johnson, D. S., L. A. McGeoch. 2002. Experimental analysis of heuristics for the STSP. G. Gutin, A. Punnen, eds. The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers, Dordrecht, The Netherlands, 369-443.
22. Koster, A. M. C. A., H. L. Bodlaender, S. P. M. van Hoesel. 2001. Treewidth: Computational experiments. Electronic Notes in Discrete Mathematics, Vol. 8. Elsevier Science Publishers, Amsterdam, The Netherlands.
23. Koster, A. M. C. A., S. P. M. van Hoesel, A. W. J. Kolen. 2002. Solving frequency assignment problems via tree-decomposition. Networks 40 170-180.
24. Lagergren, J. 1990. Efficient parallel algorithms for tree-decomposition and related problems. Proc. 31st Ann. Sympos. on the Foundations of Comput. Sci. ACM Press, New York, 173-182.
25. Lin, S., B. W. Kernighan. 1973. An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21 498-516.
26. Martin, O. C., S. W. Otto. 1996. Combining simulated annealing with local search heuristics. Ann. Oper. Res. 63 57-75.
27. Martin, O., S. W. Otto, E. W. Felten. 1991. Large-step Markov chains for the traveling salesman problem. Complex Systems 5 299-326.
28. Matoušek, J., R. Thomas. 1991. Algorithms finding tree-decompositions of graphs. J. Algorithms 12 1-22.
29. Reed, B. 1992. Finding approximate separators and computing tree-width quickly. Proc. 24th Annual ACM Sympos. on the Theory of Comput. ACM Press, New York, 221-228.
30. Reinelt, G. 1991. TSPLIB - A traveling salesman problem library. ORSA J. on Comput. 3 376-384. (An updated version is available at http://www.iwr.uni- heidelberg.de/iwr/comopt/software/TSPLIB95/.)
31. Robertson, N., P. D. Seymour. 1991. Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory, Ser. B 52 153-190.
32. Schilham, R. M. F. 2001. Commonalities in Local Search. Ph.D. thesis, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands.
33. Seymour, P. D., R. Thomas. 1994. Call routing and the ratcather. Combinatorica 14 217-241.
34. Tamaki, H. 2003. Alternating cycles contribution: A tour merging strategy for the traveling salesman problem. Research Report MPI-2003-1-007, Max-Planck-Institut für Informatik, Saarbrücken, Germany.
35. Walshaw, C. 2000. A multilevel approach to the travelling salesman problem. Technical Report 01/IM/80, Computing and Mathematical Sciences Department, University of Greenwich, London, UK.