An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
From MaRDI portal
Publication:1280545
DOI10.1016/S0020-0255(96)00084-9zbMath0918.90134MaRDI QIDQ1280545
Zoran M. Saric, Vladimir Dimitrijević
Publication date: 15 March 1999
Published in: Information Sciences (Search for Journal in Brave)
90C35: Programming involving graphs or networks
Related Items
A random-key genetic algorithm for the generalized traveling salesman problem, Transformations of generalized ATSP into ATSP., Generalized network design problems.
Cites Work
- Unnamed Item
- The traveling salesman problem: An overview of exact and approximate algorithms
- Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem
- Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
- A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem