Learn More
The Generalized Traveling Salesman Problem (GTSP) is stated as follows. Given a weighted complete digraph K∗ n and a partition V1, . . . , Vk of its vertices, find a minimum weight cycle containing exactly one vertex from each set Vi, i = 1, . . . , k. We study transformations from GTSP to TSP. The ’exact’ Noon-Bean transformation is investigated in(More)
  • 1