Sciweavers

Share
CORR
2008
Springer

Generalized Traveling Salesman Problem Reduction Algorithms

9 years 1 months ago
Generalized Traveling Salesman Problem Reduction Algorithms
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The aim of this paper is to present a problem reduction algorithm that deletes redundant vertices and edges, preserving the optimal solution. The algorithm's running time is O(N3 ) in the worst case, but it is significantly faster in practice. The algorithm has reduced the problem size by 15
Gregory Gutin, Daniel Karapetyan
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Gregory Gutin, Daniel Karapetyan
Comments (0)
books