| Article ID: | iaor19993163 |
| Country: | Canada |
| Volume: | 37 |
| Issue: | 2 |
| Start Page Number: | 114 |
| End Page Number: | 120 |
| Publication Date: | May 1999 |
| Journal: | INFOR |
| Authors: | Laporte Gilbert, Semet Frdric |
| Keywords: | vehicle routing & scheduling, computational analysis |
This note proposes a transformation of the Generalized Traveling Salesman Problem on an undirected graph into an equivalent Traveling Salesman Problem and provides an assessment of its computational efficiency.