Computational evaluation of a transformation procedure for the symmetric generalized traveling salesman problem

INFOR Journal

Volumn 37, Issue 2, 1999, Pages 114-120

  Laporte, Gilbert ^{a,c,d,e,f,g,h,i}   Semet, Frédéric ^b,f,j,k  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b UNIVERSITÉ DE VALENCIENNES   (France)

^c LONDON SCHOOL OF ECONOMICS   (United Kingdom)

^d Institut National de Commerce   (Canada)

^e UNIVERSITY OF ALBERTA   (Canada)

^f INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

^g UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^h Can Operational Research Society

ⁱ Royal Society of Canada   (Canada)

^j EPFL   (Switzerland)

^k Grp de Rech Interdisc en S   (Canada)

more..

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; MATHEMATICAL TRANSFORMATIONS;

GENERALIZED TRAVELING SALESMAN PROBLEM (GTSP);

TRAVELING SALESMAN PROBLEM;

EID: 0032643711     PISSN: 03155986     EISSN: None     Source Type: None    
DOI: 10.1080/03155986.1999.11732374     Document Type: Article

References (14)

1. M. Dror and A. Langevin (1997). "A Generalized Traveling Salesman Approach to the Directed Clustered Rural Postman Problem". Transportation Science 31, 187-192.
2. M. Fischetti, J.J. Salazar and P. Toth (1997). "A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem", Operations Research 45, 378-394.
3. A.L. Henry-Labordere (1969). "The Record Balancing Problem: A Dynamic Programming Solution of a Generalized Travelling Salesman Problem".RIRO B-2, 43-9.
4. G. Laporte (1997). "Modeling and Solving Several Classes of Arc Routing Problems as Traveling Salesman Problems". Computers & Operations Research, 24, 1057-1061.
5. G. Laporte, A. Asef-Vaziri and C. Sriskandarajah (1996). "Some Applications of the Generalized Traveling Salesman Problem". Journal of the Operational Research Society 47, 1461-1467.
6. G. Laporte and Y. Nobert (1983). "Generalized Travelling Salesman Problem through n Sets of Nodes: An Integer Programming Approach". INFOR 21, 61-75.
7. Y.N. Lien, E. Ma and B.W.-S. Wah (1993). "Transformation of the Generalized Traveling-Salesman Problem into the Standard Traveling-Salesman Problem". Information Sciences 74, 177-189.
8. S. Lin and B.W. Kernighan (1973). "An Effective Heuristic Algorithm for the Traveling Salesman Problem". Operations Research 21, 498-516.
9. C.E. Noon and J.C. Bean (1991). "A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem". Operations Research 39, 623-32.
10. C.E. Noon and J.C. Bean (1993). "An Efficient Transformation of the Generalized Traveling Salesman Problem". INFOR 31, 39-44.
11. M.W. Padberg and G. Rinaldi (1991). "A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems". SIAM Review 33, 6-100.
12. J.P. Saksena (1970). "Mathematical Model for Scheduling Clients through Welfare Agencies". CORS Journal 8, 185-200.
13. S.S. Srivastava, S. Kumar, R.C. Garg and P. Sen (1969). "Generalized Travelling Salesman Problem through Sets of Nodes". CORS Journal 7, 97-101.
14. A. Volgenant (1991). "Transforming the Generalized Traveling Salesman Problem through n Sets of Nodes into a Standard Problem". Presented at the 14th International Symposium on Mathematical Programming, Amsterdam.