In the Generalized Traveling Salesman Problem (GTSP), the aim is to determine a least cost Hamiltonian circuit or cycle through several clusters of vertices. It is shown that a wide variety of combinatorial optimization problems can be modeled as GTSPs. These problems include location-routing problems, material flow system design, post-box collection, stochastic vehicle routing and arc routing.
Paru en novembre 1995 , 14 pages
Ce cahier a été révisé en mai 1996