Des opérateurs d'échange et une méthode de relaxation pour le problème du voyageur de commerce
RAIRO - Operations Research - Recherche Opérationnelle (1992)
- Volume: 26, Issue: 1, page 57-81
- ISSN: 0399-0559
Access Full Article
top
How to cite
topSchnetzler, B.. "Des opérateurs d'échange et une méthode de relaxation pour le problème du voyageur de commerce." RAIRO - Operations Research - Recherche Opérationnelle 26.1 (1992): 57-81. <http://eudml.org/doc/105030>.
@article{Schnetzler1992,
author = {Schnetzler, B.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {simulated annealing; low-cost minima; travelling salesman problem; relaxation method},
language = {fre},
number = {1},
pages = {57-81},
publisher = {EDP-Sciences},
title = {Des opérateurs d'échange et une méthode de relaxation pour le problème du voyageur de commerce},
url = {http://eudml.org/doc/105030},
volume = {26},
year = {1992},
}
TY - JOUR
AU - Schnetzler, B.
TI - Des opérateurs d'échange et une méthode de relaxation pour le problème du voyageur de commerce
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1992
PB - EDP-Sciences
VL - 26
IS - 1
SP - 57
EP - 81
LA - fre
KW - simulated annealing; low-cost minima; travelling salesman problem; relaxation method
UR - http://eudml.org/doc/105030
ER -
References
top- 1. S. KIRPATRICK, C.D. GELATT et M.P. VECCHI, Optimization by Simulated Annealing, Science, 1983, 220, p. 671-680. Zbl1225.90162MR702485
- 2. E. BONOMI, J.L. LUTTON, The N-city Travelling Salesman Problem:Statistical Mechanics and Metropolis algorithm, S.I.A.M. Rev., 1984, 26, 4, p. 551-568. Zbl0551.90095MR765672
- 3. J.J. HOPFIELD et D.W. TANK, Neural Computation of Decisions in Optimization Problems, Biol. Cybernet. 1985, 52, p. 141-152. Zbl0572.68041MR824597
- 4. R. DURBIN et D. WILLSHAW, An Analogue Approach to the Travelling Salesman Problem Using an Elastic Net Method, Nature, 1987, 326, p. 689-691.
- 5. B. ANGÉNIOL, G. DE LA CROIX VAUBOIS et J. Y. LETEXIER, Self Organizing Feature Mapsand the Traveling Salesman Problem, Neural Networks, 1988, 1, p. 289-293.
- 6. M. MÉZARD, G. PARISIet M. A. VIRASORO, Spin Glass Theory and Beyond, World Sci. Lecture Notes Phys., 1987, 9. Zbl0992.82500MR1026102
- 7. D. S. JOHNSON, More Approaches to the Travelling Salesman Guide, Nature, 1987, 330, p. 525
- 8. S. LIN et B.W. KERNINGHAN, An Effective Heuristic Algorithm for the Traveling-Salesman Problem, Oper. Res., 1973, 21, p. 498-516. Zbl0256.90038MR359742
- 9. D.S. JOHNSON, Local Optimization and the Traveling Salesman Problem, Proceedings of the 17th Colloquium on Automat a Languages and Programming, Springer-Verlag, NewYork, 1990, p. 446-461. Zbl0766.90079MR1076835
- 10. D.L. MILLER et J.F. PEKNY, Exact Solution of Large Asymmetric Traveling Salesman Problems, Science, 1991, 251, p. 754-761.
- 11. (a) M. PADBERG et G. RINALDI, Optimization of a 532 City Symmetric Travelling Salesman Problem, 1986, Actes des « Journées du 20e anniversaire du groupe combinatoire de l'A.F.C.E.T.», I.N.R.I.A. -Rocquencourt, 1986, p.387-403;
- (b) M. PADBERG et G. RINALDI, Optimization of a 532 City Symmetric Travelling Salesman Problem by Branch and Cut, Oper. Res. Lett., 1987, 6, p. 1-7. Zbl0618.90082MR891600
- 12. D.G. BOUNDS, New Optimization Methods from Physics and Biology, Nature, 1987, 329, p. 215-219.
- 13. F. FOGELMANSOULIE et P. GALLINARI, Méthodes connexionistes d'apprentissage, École Internationale d'Informatique, A.F.C.E.T., Brest, 1989.
- 14. J. BEARDWOOD, J.H. HALTONet J.M. HAMMERSLEY, The Shortest Path Through Many Points, Proceedings of the Cambridge Philosophical Society, 1959, 55 p. 299-327. Zbl0118.35601MR109316
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.