| Article ID: | iaor19921947 |
| Country: | France |
| Volume: | 24 |
| Start Page Number: | 245 |
| End Page Number: | 253 |
| Publication Date: | Dec 1990 |
| Journal: | RAIRO Operations Research |
| Authors: | Carlier J., Villon P. |
| Keywords: | heuristics, programming: dynamic |
In this paper the authors present a new heuristic for the Traveling Salesman Problem. This heuristic is based on a dynamic programming method computing the best tour among an exponential number of tours in polynomial time. Computational results illustrating the efficiency of the method are presented.