A new heuristic for the traveling salesman problem
RAIRO - Operations Research - Recherche Opérationnelle, Volume 24 (1990) no. 3, pp. 245-253.
@article{RO_1990__24_3_245_0,
     author = {Carlier, J. and Villon, P.},
     title = {A new heuristic for the traveling salesman problem},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {245--253},
     publisher = {EDP-Sciences},
     volume = {24},
     number = {3},
     year = {1990},
     mrnumber = {1075796},
     zbl = {0724.90055},
     language = {en},
     url = {http://archive.numdam.org/item/RO_1990__24_3_245_0/}
}
TY  - JOUR
AU  - Carlier, J.
AU  - Villon, P.
TI  - A new heuristic for the traveling salesman problem
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1990
SP  - 245
EP  - 253
VL  - 24
IS  - 3
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/RO_1990__24_3_245_0/
LA  - en
ID  - RO_1990__24_3_245_0
ER  - 
%0 Journal Article
%A Carlier, J.
%A Villon, P.
%T A new heuristic for the traveling salesman problem
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1990
%P 245-253
%V 24
%N 3
%I EDP-Sciences
%U http://archive.numdam.org/item/RO_1990__24_3_245_0/
%G en
%F RO_1990__24_3_245_0
Carlier, J.; Villon, P. A new heuristic for the traveling salesman problem. RAIRO - Operations Research - Recherche Opérationnelle, Volume 24 (1990) no. 3, pp. 245-253. http://archive.numdam.org/item/RO_1990__24_3_245_0/

1. R. Bellman, Dynamic Programming Treatment of The Traveling Salesman Problem, J.A.C.M., 1962, 9, pp. 61-63. | MR | Zbl

2. R. Bellman, Dynamic Programming, Princeton University, New-Jersey, 1965. | MR | Zbl

3. C. Berge, Graphs and Hypergraphs, North Holland, Amsterdam, 1973. | MR | Zbl

4. E. Bonomi and J. L. Lutton, The N-city Traveling Salesman Problem: "Statistical Mechanics and Metropolis Algorithm", S.I.A.M. rev., 1984, 26, n° 4. | MR | Zbl

5. J. Carlier and P. Villon, A Well Solved Case of the Traveling Salesman Problem, Research Report, Université de Technologie de Compiègne, 8, July 1987.

6. J. Edmonds and E. L. Johnson, Matching, Euler Tours and the Chinese Postman, Math. Program., 1973, 5, pp. 88-124. | MR | Zbl

7. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, The Traveling Salesman Problem, Wiley, Chichester, 1985. | MR | Zbl

8. S. Lin and B. W. Kerninghan, An Effective Heuristic Algorithm for the Traveling Salesman Problem, Oper. Res., 1973, 21, pp. 498-516. | MR | Zbl

9. M. W. Padberg and S. Hong, On the Symmetric Traveling Salesman Problem: a Computational Study, Math. Program. Stud., 1980, 12, pp. 78-107. | MR | Zbl

10. M. W. Padberg and G. Rinaldi, Optimization of a 532-city Symmetric Traveling Salesman Problem, A.F.C.E.T. Combinatorial group 20th anniversary, A.F.C.E.T. Publisher, 1986.

11. H. D. Ratliff and A. S. Rosenthal, Order Picking in a Rectangular Warehouse: a Solvable Case of the Traveling Salesman Problem, Oper. Res., 1983, 31, pp. 507-521. | Zbl

12. J. Fonlupt and A. Nachef, Dynamic Programming and the Graphical Traveling Salesman Problem. Research report, ARTEMIS Laboratory, Grenoble, 1989. | Zbl