| Article ID: | iaor2000714 |
| Country: | Greece |
| Volume: | 11 |
| Issue: | 1 |
| Start Page Number: | 13 |
| End Page Number: | 26 |
| Publication Date: | Dec 1997 |
| Journal: | Studies In Locational Analysis |
| Authors: | Laporte Gilbert |
| Keywords: | programming: travelling salesman |
Several problems arising in distribution management, manufacturing and telecommunications can be cast in terms of optimally locating a tour in a graph. The simplest example is the Traveling Salesman Problem (TSP). This paper describes several applications of this class of problems: the Covering Tour Problem, the Selective TSP, the Prize Collecting TSP, the Generalized TSP, a transit line location problem, and a ring design problem arising in telecommunications.