Assignment problem based algorithms are impractical for the generalized TSP

Australasian Journal of Combinatorics

Volumn 27, Issue , 2003, Pages 149-153

  Gutin, Gregory ^a   Yeo, Anders ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77949914653     PISSN: 10344942     EISSN: 22023518     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. 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, Algorithm Engineering and Experimentation, Third International Workshop, ALENEX 2001, Lect. Notes Comput. Sci., Vol. 2153, pages 32-59. Springer-Verlag, Berlin, 2001.
2. V. Dimitrijević and Z. Sarić. An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs. Information Sciences, 102:105-110, 1997.
3. M. Fischetti, A. Lodi, and P. Toth. Exact methods for the ATSP. In The Traveling Salesman Problem and its Variations, (G. Gutin and A.P. Punnen, eds.), Kluwer, Dordrecht, 2002.
4. M. Fischetti, J.J. Salazar, and P. Toth. The symmetric generalized traveling salesman polytope. Networks, 26:113-123, 1995.
5. M. Fischetti, J.J. Salazar, and P. Toth. A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Operations Research, 45:378-394, 1997.
6. M. Fischetti, J.J. Salazar, and P. Toth. The generalized traveling salesman and orienteering problem. In The Traveling Salesman Problem and its Variations, (G. Gutin and A.P. Punnen, eds.), Kluwer, Dordrecht, 2002.
7. F. Glover, G. Gutin, A. Yeo, and A. Zverovich. Construction heuristics and domination analysis for the asymmetric TSP. European J. Oper. Res., 129:555-568, 2001.
8. D.S. Johnson, G. Gutin, L.A. McGeoch, A. Yeo, W. Zhang, and A. Zverovich. Experimental analysis of heuristics for the ATSP. In The Traveling Salesman Problem and its Variations, (G. Gutin and A.P. Punnen, eds.), Kluwer, Dordrecht, 2002.
9. G. Laporte, A. Asef-Vaziri, and C. Sriskandarajah. Some applications of the generalized traveling salesman problem. J. Oper. Res. Soc., 47:1461-1467, 1996.
10. G. Laporte, H. Mercure, and Y. Nobert. Generalized Travelling Salesman Problem through n sets of nodes: the asymmetrical cases. Discrete Applied Mathematics, 18:185-197, 1987.
11. G. Laporte and Y. Nobert. Generalized Travelling Salesman through n sets of nodes: an integer programming approach. INFOR, 21:61-75, 1983.
12. Y. Lien, E. Ma, and B.W.S. Wah. Transformation of the generalized traveling salesman problem into the standard traveling salesman problem. Information Sciences, 74:177-189, 1993.
13. C.E. Noon. The Generalized Traveling Salesman Problem. Unpublished Dissertation, Department of Industrial and Operations Research, University of Tennessee, 1988.
14. C.E. Noon and J.C. Bean. A Lagrangian based approach for the asymmetric generalized traveling salesman problem. Operations Research, 39:623-632, 1991.
15. J.J. Salazar. Algoritmi per il problema del Commesso Viaggiatore Generalizzato. PhD thesis, Royal Spanish College in Bologna, 1992. (in Italian).
16. M.M. Sepehri. The symmetric generalized travelling salesman problem. PhD thesis, University of Tennessee, Knoxville, 1991.