An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs

DOI10.1016/S0020-0255(96)00084-9zbMath0918.90134MaRDI QIDQ1280545

Vladimir Dimitrijević, Zoran M. Saric

Publication date: 15 March 1999

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

heuristicsgeneralized traveling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

A two-level metaheuristic for the all colors shortest path problem, Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics, A random-key genetic algorithm for the generalized traveling salesman problem, A branch-and-cut algorithm for the generalized traveling salesman problem with time windows, Transformations of generalized ATSP into ATSP., A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem, A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem, Generalized network design problems., A construction for directed in-out subgraphs of optimal size, Discrete/Binary Approach

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