Tolerance-based Branch and Bound algorithms for the ATSP

European Journal of Operational Research

Volumn 189, Issue 3, 2008, Pages 775-788

  Turkensteen, Marcel ^a   Ghosh, Diptesh ^b   Goldengorin, Boris ^a,c   Sierksma, Gerard ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

^b INDIAN INSTITUTE OF MANAGEMENT   (India)

^c KHMELNYTSKYI NATIONAL UNIVERSITY   (Ukraine)

Author keywords

Branch and Bound; NP hard problems; Tolerances

Indexed keywords

ALGORITHMS; BRANCH AND BOUND METHOD; COMPUTATIONAL COMPLEXITY; COST ACCOUNTING;

ASSIGNMENT SOLUTIONS; BOUND ALGORITHMS; BRANCHING PROCESS;

TRAVELING SALESMAN PROBLEM;

EID: 40849092548     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.10.062     Document Type: Article

References (23)

1. Achterberg T., Koch T., and Martin A. Branching rules revisited. Operations Research Letters 33 1 (2004) 42-54
2. Balas E., and Toth P. Branch and Bound Methods. In: Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., and Shmoys D.B. (Eds). The Traveling Salesman Problem (1985), John Wiley & Sons, Chichester pp. 361-401 (Chapter 10)
3. Buriol L.M., França P.M., and Moscato P. A new memetic algorithm for the asymmetric traveling salesman problem. Journal of Heuristics 10 (2004) 483-506
4. Carpaneto G., and Toth P. Some new branching and bounding criteria for the asymmetric traveling salesman problem. Management Science 21 (1980) 736-743
5. Carpaneto G., Dell'Amico M., and Toth P. Exact solution of large-scale asymmetric traveling salesman problems. ACM Transactions on Mathematical Software 21 4 (1995) 394-409
6. Dell'Amico M., and Toth P. Algorithms and codes for dense assignment problems: the state of the art. Discrete Applied Mathematics 100 (2000) 17-48
7. Fischetti M., Lodi A., and Toth P. Exact Methods for the Asymmetric Traveling Salesman Problem. In: Gutin G., and Punnen A.P. (Eds). The Traveling Salesman Problem and its Variations (2002), Kluwer, Dordrecht 169-194 (Chapter 9)
8. Gessner G., Malhotra N.K., Kamakura W.A., and Zmijevski M.E. Estimating models with binary dependent variables: some theoretical and empirical observations. Journal of Business Research 16 1 (1988) 49-65
9. Goldengorin B., Sierksma G., and Turkensteen M. Tolerance based algorithms for the ATSP. Lecture Notes in Computer Science 3353 June (2004) 222-234
10. Hair J.F., Anderson R.E., Tatham R.L., and Black W.C. Multivariate Data Analysis. fifth ed. (1998), Prentice-Hall
11. Helsgaun K. An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research 12 (2000) 106-130
12. Hosmer D.W., and Lemeshow S. Applied Logistic Regression. first ed. (1989), John Wiley & Sons
13. Hubert L.J., and Arabie P. Comparing partitions. Journal of Classification 2 (1985) 193-218
14. Johnson, D.S., 2006 Machine comparison site. .
15. Jonker R., and Volgenant A. Improving the Hungarian assignment algorithm. Operations Research Letters 5 (1986) 171-175
16. Karp R.M., and Steele J.M. Probabilistic Analysis of Heuristics. The Traveling Salesman Problem (1990), Wiley, New York pp. 181-205 (Chapter 5)
17. Libura M. Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems. Discrete Applied Mathematics 30 (1991) 197-211
18. Libura M., Van der Poort E.S., Sierksma G., and Van der Veen J.A.A. Stability aspects of the traveling salesman problem based on k-best solutions. Discrete Applied Mathematics 87 (1998) 159-185
19. Lin C.-J., and Wen U.-P. Sensitivity analysis of the optimal assignment. Discrete Optimization 149 (2003) 35-46
20. Miller D.L., and Pekny J.F. Exact solution of large asymmetric traveling salesman problems. Science 251 (1991) 754-761
21. 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, Dordrecht pp. 29-116 (Chapter 2)
22. Reinelt G. TSPLIB - a traveling salesman problem library. ORSA Journal on Computing 3 (1991) 376-384
23. Zhang W. Truncated branch-and-bound: a case study on the asymmetric TSP. In AAAI-93 Spring Symposium on AI and NP-Hard Problems (1993) 160-166 Stanford