Cut-and-solve: An iterative search strategy for combinatorial optimization problems

Artificial Intelligence

Volumn 170, Issue 8-9, 2006, Pages 714-738

  Climer, Sharlee ^a   Zhang, Weixiong ^a  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

Anytime algorithms; Branch and bound; Branch and cut; Linear programming; Search strategies; Traveling Salesman Problem

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; LINEAR PROGRAMMING; OPTIMIZATION; SEARCH ENGINES; TRAVELING SALESMAN PROBLEM;

ANYTIME ALGORITHMS; BRANCH-AND-BOUND; BRANCH-AND-CUT; SEARCH STRATEGIES;

PROBLEM SOLVING;

EID: 33646106102     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2006.02.005     Document Type: Article

References (49)

1. Applegate D., Bixby R., Chvátal V., and Cook W. TSP cuts which do not conform to the template paradigm. In: Junger M., and Naddef D. (Eds). Computational Combinatorial Optimization (2001), Springer, New York 261-304
2. Applegate D., Bixby R., Chvátal V., and Cook W. Concorde-A code for solving Traveling Salesman Problems. 15/12/99 Release. http://www.tsp.gatech.edu//concorde.html web
3. D. Applegate, R. Bixby, V. Chvátal, W. Cook, On the solution of Traveling Salesman Problems, in: Documenta Mathematica, Extra volume ICM III, 1998, pp. 645-656
4. Balas E., and Toth P. Branch and bound methods. The Traveling Salesman Problem (1985), John Wiley & Sons, Essex, England 361-401
5. F. Bock, An algorithm for solving 'traveling-salesman' and related network optimization problems, Technical report, Armour Research Foundation, 1958. Presented at the Operations Research Society of America 14th National Meeting, St. Louis, October 1958
6. M. Boddy, T. Dean, Solving time-dependent planning problems, in: Proceedings of IJCAI-89, Detroit, MI, 1989, pp. 979-984
7. Carpaneto G., Dell'Amico M., and Toth P. Exact solution of large-scale, asymmetric Traveling Salesman Problems. ACM Transactions on Mathematical Software 21 (1995) 394-409
8. J. Cirasella, D.S. Johnson, L. McGeoch, W. Zhang, The asymmetric traveling salesman problem: Algorithms, instance generators, and tests, in: Proc. of the 3rd Workshop on Algorithm Engineering and Experiments, 2001
9. S. Climer, W. Zhang, Searching for backbones and fat: A limit-crossing approach with applications, in: Proceedings of the 18th National Conference on Artificial Intelligence (AAAI-02), Edmonton, Alberta, July 2002, pp. 707-712
10. Climer S., and Zhang W. Cut-and-solve code for the ATSP (2004). http://www.cse.wustl.edu/~zhang/projects/tsp/cutsolve or
11. S. Climer, W. Zhang, A linear search strategy using bounds, in: Proc. 14th International Conference on Automated Planning and Scheduling (ICAPS'04), Whistler, Canada, June 2004, pp. 132-141
12. Croes G.A. A method for solving traveling-salesman problems. Operations Research 6 (1958) 791-812
13. Dantzig G. Maximization of linear function of variables subject to linear inequalities. In: Koopmans T.C. (Ed). Activity Analysis of Production and Allocation (1951), Wiley, New York
14. Dantzig G.B., Fulkerson D.R., and Johnson S.M. Solution of a large-scale traveling-salesman problem. Operations Research 2 (1954) 393-410
15. R. Dechter, F. Rossi, Constraint satisfaction, in: Encyclopedia of Cognitive Science, March 2000
16. W.L. Eastman, Linear programming with pattern constraints, PhD thesis, Harvard University, Cambridge, MA, 1958
17. Fischetti M., Lodi A., and Toth P. Exact methods for the Asymmetric Traveling Salesman Problem. In: Gutin G., and Punnen A. (Eds). The Traveling Salesman Problem and its Variations (2002), Kluwer Academic, Norwell, MA
18. Fischetti M., Salazar J.J., and Toth P. The generalized traveling salesman and orienteering problems. In: Gutin G., and Punnen A. (Eds). The Traveling Salesman Problem and its Variations (2002), Kluwer Academic, Norwell, MA 609-662
19. C.P. Gomes, B. Selman, H. Kautz, Boosting combinatorial search through randomization, in: Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98), New Providence, RI, 1998, pp. 431-438
20. Gomory R.E. Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society 64 (1958) 275-278
21. D. Gusfield, S.H. Orzack, Haplotype inference, in: S. Aluru (Ed.), Handbook on Bioinformatics, CRC, 2005, in press
22. Gutin G., and Punnen A.P. The Traveling Salesman Problem and its Variations (2002), Kluwer Academic, Norwell, MA
23. Hart T.P., Nilsson N.J., and Raphael B. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems, Science and Cybernetics 4 (1968) 100-107
24. W.D. Harvey, M.L. Ginsberg, Limited discrepancy search, in: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), vol. 1, Montreal, Canada, August 1995
25. Held M., and Karp R.M. The traveling salesman problem and minimum spanning trees. Operations Research 18 (1970) 1138-1162
26. Held M., and Karp R.M. The traveling salesman problem and minimum spanning trees: Part ii. Mathematical Programming 1 (1971) 6-25
27. Hillier F., and Lieberman G. Introduction to Operations Research. sixth ed. (2001), McGraw-Hill, Boston
28. Hoffman K.L., and Padberg M. Improving LP-representations of zero-one linear programs for branch-and-cut. ORSA Journal on Computing 3 (1991) 121-134
29. Ilog. http://www.cplex.com web
30. Johnson D.S., Gutin G., McGeoch L.A., Yeo A., Zhang W., and Zverovich A. Experimental analysis of heuristics for the ATSP. In: Gutin G., and Punnen A. (Eds). The Traveling Salesman Problem and its Variations (2002), Kluwer Academic, Norwell, MA
31. D.S. Johnson, L.A. McGeoch, E.E. Roghberg, Asymptotic experimental analysis for the Held-Karp Traveling Salesman bound, in: Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 1996, pp. 341-350
32. Jonker R., and Volgenant T. Transforming asymmetric into symmetric traveling salesman problems. Operations Research Letters 2 (1983) 161-163
33. Khaciyan L.G. A polynomial algorithm for linear programming. Doklady Akademii Nauk SSSR 244 (1979) 1093-1096
34. Korf R.E. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27 (1985) 97-109
35. Korf R.E. A complete anytime algorithm for number partitioning. Artificial Intelligence 105 (1998) 133-155
36. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., and Shmoys D.B. The Traveling Salesman Problem (1985), John Wiley & Sons, Essex, England
37. M.S. Levine, Experimental study of minimum cut algorithms, PhD thesis, Computer Science Dept., Massachusetts Institute of Technology, Massachusetts, May 1997
38. Levine M.S. Minimum cut code. http://theory.lcs.mit.edu/~mslevine/mincut/index.html web
39. Martello S., and Toth P. Linear assignment problems. Annals of Discrete Mathematics 31 (1987) 259-282
40. Monasson R., Zecchina R., Kirkpatrick S., Selman B., and Troyansky L. Determining computational complexity from characteristic 'phase transitions'. Nature 400 (1999) 133-137
41. Mou Z.G., and Hudak P. An algebraic model of divide-and-conquer and its parallelism. Journal of Supercomputing 2 (1988) 257-278
42. Pearl J. Heuristics: Intelligent Search Strategies for Computer Problem Solving (1984), Addison-Wesley, Reading, MA
43. Rossman M.J., and Twery R.J. A solution to the travelling salesman problem. Operations Research 6 (1958) 687 Abstract E3.1.3
44. Saltelli A., Tarantola S., Campolongo F., and Ratto M. Sensitivity Analysis in Practice: A Guide to Assessing Scientific Models (2004), John Wiley & Sons, Ltd., West Sussex, England
45. Williams H.P. Model Building in Mathematical Programming. second ed. (1985), John Wiley and Sons, Chichester
46. W. Zhang, Complete anytime beam search, in: Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98), Madison, WI, July 1998, pp. 425-430
47. W. Zhang, Depth-first branch-and-bound vs. local search: A case study, in: Proceedings of the 17th National Conference on Artificial Intelligence (AAAI-2000), Austin, TX, July 2000, pp. 930-935
48. Zhang W. Phase transitions and backbones of the asymmetric Traveling Salesman. Journal of Artificial Intelligence Research 20 (2004) 471-497
49. Zhang W., and Korf R.E. Performance of linear-space search algorithms. Artificial Intelligence 79 (1995) 241-292