Tolerance based algorithms for the ATSP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3353, Issue , 2004, Pages 222-234

  Goldengorin, Boris ^a   Sierksma, Gerard ^a   Turkensteen, Marcel ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; TRAVELING SALESMAN PROBLEM; COMBINATORIAL OPTIMIZATION; GRAPH THEORY;

'CURRENT; ARC COSTS; ASSIGNMENT PROBLEMS; ASYMMETRIC TRAVELLING SALESMAN PROBLEMS; BEST CHOICE; BRANCH AND BOUNDS; BRANCHING PROCESS; LOW BOUND; SHORT CYCLE; TOLERANCE VALUES; ASYMMETRIC TRAVELING SALESMAN PROBLEM; COMPUTATIONAL EXPERIMENT; LOWER BOUNDS; SHORTEST CYCLE;

COMBINATORIAL OPTIMIZATION; TRAVELING SALESMAN PROBLEM;

EID: 33746234376     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30559-0_19     Document Type: Article

References (12)

1. E. Balas, P. Toth. Branch and bound methods. Chapter 10 in: The Traveling Salesman Problem. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.). John Wiley & Sons, Chichester, 1985.
2. W.J.Cook, W.H. Cunningham, W.R. Pulleyblank, A. Schrijver. Combinatorial Optimization. John Wiley & Sons, Chichester, 361-402, 1998.
3. M. Fischetti, A. Lodi, P. Toth. Exact methods for the asymmetric traveling salesman problem. Chapter 2 in: The Traveling Salesman Problem and Its Variations. G. Gutin, A.P. Punnen (Eds.). Kluwer, Dordrecht, 169-194, 2002.
4. D.S. Johnson, L.A. McGeoch. Experimental analysis of heuristics for the STSP. Chapter 9 in: The Traveling Salesman Problem and Its Variations. G. Gutin, A.P. Punnen (Eds.). Kluwer, Dordrecht, 369-444, 2002.
5. D.S. Johnson, G. Gutin, L.A. McGeoch, A. Yeo, W. Zhang, A. Zverovich. Experimental analysis of heuristics for the ATSP. Chapter 10 in: The Traveling Salesman Problem and Its Variations. G. Gutin, A.P. Punnen (Eds.). Kluwer, Dordrecht, 445-489, 2002.
6. B. Goldengorin, G. Sierksma. Combinatorial optimization tolerances calculated in linear time. SOM Research Report 03A30, University of Groningen, Groningen, The Netherlands, 2003 (http://www.ub.rug.nl/eldoc/som/a/03A30/03a30. pdf).
7. H. Greenberg. An annotated bibliography for post-solution analysis in mixed integer and combinatorial optimization. In: D. L. Woodruff (Ed.). Advances in computational and stochastic optimization, logic programming, and heuristic search. Kluwer Academic Publishers, Dordrecht, 97-148, 1998.
8. K. Helsgaun. An effective implementation of the Lin-Kernigan traveling salesman heuristic. European Journal of Operational Research 126 106-130, 2000.
9. L.J. Hubert, P. Arabie, Comparing Partitions, Journal of Classification 2 193-218, 1985.
10. M. Libura. Sensitivity analysis for minimum hamiltonian path and traveling salesman problems. Discrete Applied Mathematics 30 197-211, 1991.
11. D. Naddef. Polyhedral theory and branch-and-cut algorithms for the symmetric TSP. Chapter 2 in: The Traveling Salesman Problem and Its Variations. G. Gutin, A.P. Punnen (Eds.). Kluwer, Dordrecht, 29-116, 2002.
12. G. Reinelt. TSPLIB - a Traveling Salesman Problem Library. ORSA Journal on Computing 3 376-384, 1991.