An Efficient Transformation of the Generalized Traveling Salesman Problem into the Traveling Salesman Problem on Digraphs

Information Sciences

Volumn 102, Issue 1-4, 1997, Pages 105-110

  Dimitrijević, Vladimir ^a   Šarić, Zoran ^b  

^a UNIVERSITY OF UDINE   (Italy)

^b MATHEMATICAL INSTITUTE   (Serbia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HEURISTIC METHODS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING;

GENERALIZED TRAVELING SALESMAN PROBLEM (GTSP);

OPTIMIZATION;

EID: 0031282026     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(96)00084-9     Document Type: Article

References (6)

1. D. Cvetković, V. Dimitrijević, and M. Milosavljević, Variations on the traveling salesman theme, Unpublished manuscript.
2. G. Laporte and Y. Nobert, Generalized traveling salesman problem through «sets of nodes: An integer programming approach, INFOR 21:60-75 (1983).
3. G. Laporte, The traveling salesman problem: An overview of exact and approximate algorithms, European J. Operational Research 59:231-247 (1992).
4. E. L. Lawler, J. K. Lenstra, A. H. G. R. Kan, and D. B. Shmoys, Eds., The Traveling Salesman Problem, Wiley, Chichester, 1985.
5. Y.-N, Lien and E. Ma, Transformation of the generalized traveling salesman problem into the standard traveling salesman problem, Inform. Sci. 74:177-189 (1993).
6. C. E. Noon and J. C. Bean, A Lagrangian based approach for the asymmetric generalized traveling salesman problem, Oper. Res. 39(4):623-632 (1991).