Solving real-world ATSP instances by branch-and-cut

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

Volumn 2570, Issue , 2003, Pages 64-77

  Fischetti, Matteo ^a   Lodi, Andrea ^b   Toth, Paolo ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; TRAVELING SALESMAN PROBLEM;

ASYMMETRIC TRAVELING SALESMAN PROBLEM; BRANCH AND CUT; BRANCH-AND-CUT ALGORITHMS; EXACT METHODS; REAL-WORLD;

INTEGER PROGRAMMING;

EID: 35248885707     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36478-1_8     Document Type: Article

References (28)

1. D. Applegate, R.E. Bixby, V. Chvátal, and W. Cook. Concorde - a code for solving traveling salesman problems. 12/15/1999 Release. http://www.keck.caam.rice.edu/concorde.html.
2. D. Applegate, R.E. Bixby, V. Chvátal, and W. Cook. On the solution of traveling salesman problems. Documenta Mathematica, Extra Volume ICM III:645-656, 1998.
3. N. Ascheuer. Hamiltonian Path Problems in the On-line Optimization of Flexible Manufacturing Systems. PhD thesis, Technische Universität Berlin, Germany, 1995.
4. N. Ascheuer, M. Fischetti, and M. Grötschel. A polyhedral study of the asymmmetric travelling salesman problem with time windows. Networks, 36:69-79, 2000.
5. N. Ascheuer, M. Fischetti, and M. Grötschel. Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Mathematical Programming, Ser. A, 90:475-506, 2001.
6. N. Ascheuer, M. Jünger, and G. Reinelt. A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints. Computational Optimization and Applications, 17:61-84, 2000.
7. E. Balas. The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph. SIAM Journal on Discrete Mathematics, 2:425-451, 1989.
8. E. Balas. Personal communication, 2000.
9. E. Balas and M. Fischetti. A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets. Mathematical Programming, Ser. A, 58:325-352, 1993.
10. E. Balas and M. Fischetti. Polyhedral theory for the asymmetric traveling salesman problem. In G. Gutin and A. Punnen, editors, The Traveling Salesman Problem and its Variations, pages 117-168. Kluwer Academic Publishers, 2002.
11. G. Carpaneto, M. Dell'Amico, and P. Toth. Algorithm CDT: a subroutine for the exact solution of large-scale asymmetric traveling salesman problems. ACM Transactions on Mathematical Software, 21:410-415, 1995.
12. J. Cirasella, D.S. Johnson, L.A. McGeoch, and W. Zhang. The asymmetric traveling salesman problem: Algorithms, instance generators, and tests. In A.L. Buchsbaum and J. Snoeyink, editors, Proceedings of ALENEX'01, volume 2153 of Lecture Notes in Computer Science, pages 32-59. Springer-Verlag, Heidelberg, 2001.
13. M. Fischetti. Facets of the asymmetric traveling salesman polytope. Mathematics of Operations Research, 16:42-56, 1991.
14. M. Fischetti, A. Lodi, S. Martello, and P. Toth. A polyhedral approach to simplified crew scheduling and vehicle scheduling problems. Management Science, 47:833-850, 2001.
15. M. Fischetti, A. Lodi, and P. Toth. Exact methods for the asymmetric traveling salesman problem. In G. Gutin and A. Punnen, editors, The Traveling Salesman Problem and its Variations, pages 169-205. Kluwer Academic Publishers, 2002.
16. M. Fischetti and P. Toth. An additive bounding procedure for the asymmetric travelling salesman problem. Mathematical Programming, Ser. A, 53:173-197, 1992.
17. M. Fischetti and P. Toth. A polyhedral approach to the asymmetric traveling salesman problem. Management Science, 43:1520-1536, 1997.
18. A.M.H. Gerards and A. Schrijver. Matrices with the Edmonds-Johnson property. Combinatorica, 6:365-379, 1986.
19. M. Grötschel and M.W. Padberg. Polyhedral theory. In E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and Shmoys D.B. eds., editors, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, pages 251-305. Wiley, Chichester, 1985.
20. R. Jonker and T. Volgenant. Transforming asymmetric into symmetric traveling salesman problems. Operations Research Letters, 2:161-163, 1983.
21. M. Jünger, G. Reinelt, and G. Rinaldi. The traveling salesman problem. In M. Ball, T.L. Magnanti, C.L. Monma, and G. Nemhauser, editors, Network Models, volume 7 of Handbooks in Operations Research and Management Science, pages 255-330. North Holland, Amsterdam, 1995.
22. R.M. Karp. Reducibility among combinatorial problems. In R.E. Miller and J.W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, New York, 1972.
23. A. Löbel. Vehicle scheduling in public transit and Lagrangean pricing. Management Science, 44:1637-1649, 1998.
24. S. Martello. An enumerative algorithm for finding Hamiltonian circuits in a directed graph. ACM Transactions on Mathematical Software, 9:131-138, 1983.
25. D. Naddef. Polyhedral theory and branch-and-cut algorithms for the symmetric TSP. In G. Gutin and A. Punnen, editors, The Traveling Salesman Problem and its Variations, pages 29-116. Kluwer Academic Publishers, 2002.
26. M.W. Padberg and G. Rinaldi. An efficient algorithm for the minimum capacity cut problem. Mathematical Programming, Ser. A, 47:19-36, 1990.
27. M.W. Padberg and G. Rinaldi. Facet identification for the symmetric traveling salesman polytope. Mathematical Programming, Ser. A, 47:219-257, 1990.
28. G. Reinelt. TSPLIB - a traveling salesman problem library. ORSA Journal on Computing, 3:376-384, 1991. http://www.crpc.rice.edu/softlib/tsplib/.