Transformations of generalized ATSP into ATSP.

DOI10.1016/S0167-6377(03)00031-2zbMath1033.90097MaRDI QIDQ1400345

D. Massart

Publication date: 13 August 2003

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

TSP; Heuristics; Domination analysis; Generalized TSP

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C27: Combinatorial optimization

Related Items

Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem, An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem, Domination analysis for minimum multiprocessor scheduling, A random-key genetic algorithm for the generalized traveling salesman problem, A memetic algorithm for the generalized traveling salesman problem, A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem, Approximation algorithms for group prize-collecting and location-routing problems, Domination analysis of combinatorial optimization problems.

Uses Software

• TSPLIB
• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
• On the solution of traveling salesman problems
• An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
• Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem
• TSP heuristics: domination analysis and complexity
• Domination analysis of some heuristics for the traveling salesman problem
• The traveling salesman problem and its variations
• Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
• A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
• TSPLIB—A Traveling Salesman Problem Library
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• Some Applications of the Generalized Travelling Salesman Problem
• The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• Process planning for rotational parts using the generalized travelling salesman problem
• The symmetric generalized traveling salesman polytope
• Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
• Construction heuristics for the asymmetric TSP.