A branch-and-cut algorithm for the symmetric generalized traveling salesman problem

Operations Research

Volumn 45, Issue 3, 1997, Pages 378-394

  Fischetti, Matteo ^a   González, Juan José Salazar ^b   Toth, Paolo ^c  

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSIDAD DE LA LAGUNA   (Spain)

^c UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; OPTIMIZATION; SCHEDULING;

BRANCH AND CUT ALGORITHM; SYMMETRIC GENERALIZED TRAVELING SALESMAN PROBLEM;

ALGORITHMS;

EID: 0031144089     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.45.3.378     Document Type: Article

References (26)

1. AHUJA, R. K., T. L. MAGNANTI, AND J. B. ORLIN. 1989. Network Flows. In G. L. Nemhauser, A. H. G. Rinnooy Kan, M. J. Todd (eds.), Optimization, Vol. I. North-Holland, 211-370.
2. BALAS, E. 1989. The Prize Collecting Traveling Salesman Problem. Networks, 19, 621-636.
3. BALAS, E. 1993. The Prize Collecting Traveling Salesman Problem: II. Polyhedral Results. Working Paper, Carnegie Mellon University.
4. CARPANETO, G., M. FISCHETTI, AND P. TOTH. 1989. New Lower Bounds for the Symmetric Traveling Salesman Problem. Math. Programming, 45, 233-254.
5. FISCHETTI, M., J. J. SALAZAR, AND P. TOTH. 1995. The Symmetric Generalized Traveling Salesman Polytope. Networks, 26, 113-123.
6. FISCHETTI, M., AND P. TOTH. 1988. An Additive Approach for the Optimal Solution of the Prize-Collecting Traveling Salesman Problem. In Vehicle Routing: Methods and Studies, B. L. Golden and A. A. Assad (eds.), North-Holland, 319-343.
7. GOLDEN, B. L., AND W. R. STEWART. 1985. Empirical Analysis of Heuristics. In The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan and D. B. Shmoys (Eds.), Wiley, New York, 207-245.
8. GOMORY, R. E., AND T. C. Hu. 1961. Multi-Terminal Network Flows. SIAM J. 9, 551-570.
9. GRÖTSCHEL, M., AND O. HOLLAND. 1991. Solution of Large-Scale Symmetric Traveling Salesman Problems. Math. Programming, 51, 141-202.
10. HELD, M., AND R. M. KARP. 1971. The Traveling Salesman Problem and Minimum Spanning Trees: Part II. Math. Programming, 1, 6-25.
11. JÜNGER, M., G. REINELT, AND G. RINALDI. 1995. The Traveling Salesman Problem. In Handbook in Operations Research and Management Science: Network Models. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser (eds.), Elsevier, Amsterdam.
12. KRUSKAL, J. B. 1956. On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proc. AMS, 7, 48-50.
13. LAFORTE, G., H. MERCURE, AND Y. NOBERT. 1987. Generalized Traveling Salesman Problem Through n Sets of Nodes: The Asymmetrical Cases. Discrete Appl. Math. 18, 185-197.
14. LAPORTE, G., AND Y. NOBERT. 1983. Generalized Traveling Salesman Through n Sets of Nodes: An Integer Programming Approach. INFOR, 21, 61-75.
15. LAWLER, E. L., J. K. LENSTRA, A. H. G. RINNOOY KAN, AND D. B. SHMOYS (EDS). 1985. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, NY.
16. NEMHAUSER, G. L., AND L. A. WOLSEY. 1988. Integer and Combinatorial Optimization. Wiley, NY.
17. NOON, C. E. 1988. The Generalized Traveling Salesman Problem. Unpublished Dissertation, Department of Industrial and Operations Research, University of Tennessee.
18. NOON, C. E., AND J. C. BEAN. 1991. A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem. Opns. Res. 39, 623-632.
19. PADBERG, M. W., AND M. GRÖTSCHEL. 1985. Polyhedral Computations. In The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan and D. B. Shmoys (Eds.), Wiley, New York, 307-360.
20. PADBERG, M. W., AND M. R. RAO. 1982. Odd Minimum Cut-Sets and b-Matching, Math. O.R. 7, 67-80.
21. PADBERG, M. W., AND G. RINALDI. 1987. Optimization of a 532-city Symmetric Traveling Salesman Problem. O. R. Lett. 6, 1-7.
22. PADBERG, M. W., AND G. RINALDI. 1990. Facet Identification for the Symmetric Traveling Salesman Polytope. Math. Programming, 47, 219-257.
23. PADBERG, M. W., AND G. RINALDI. 1991. A Branch-and-cut Algorithm for the Resolution of Large-scale Symmetric Traveling Salesman Problems. SIAM Review, 33, 60-100.
24. REINELT, G. 1991. TSPLIB-A Traveling Salesman Problem Library. ORSA J. Comput. 3, 376-384.
25. SALAZAR, J. J. 1992. Algoritmi per il Problema del Commesso Viaggiatore Generalizzato. Ph.D. Dissertation, Royal Spanish College in Bologna, Italy.
26. SEPEHRI, M. M. 1991. The Symmetric Generalized Traveling Salesman Problem. Ph.D. Dissertation, University of Tennessee, Knoxville.