|
Avtomatika i Telemekhanika, 1980, Issue 11, Pages 76–84
(Mi at7225)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Developing Systems
Experimental effectiveness study of heuristic algorithms for solution of the traveling salesman problem
V. V. Borodin, S. Y. Lovetskiy, I. I. Melamed, Yu. M. Plotinskii Moscow
Abstract:
Heuristic algorithms are studied for solution of the traveling salesman problem as are algorithms for obtaining the lower bounds of an optimal solution. Results are given from computing experiments and advice is given on choice of most effective algorithms.
Received: 10.07.1979
Citation:
V. V. Borodin, S. Y. Lovetskiy, I. I. Melamed, Yu. M. Plotinskii, “Experimental effectiveness study of heuristic algorithms for solution of the traveling salesman problem”, Avtomat. i Telemekh., 1980, no. 11, 76–84; Autom. Remote Control, 41:11 (1981), 1543–1550
Linking options:
https://www.mathnet.ru/eng/at7225 https://www.mathnet.ru/eng/at/y1980/i11/p76
|
Statistics & downloads: |
Abstract page: | 687 | Full-text PDF : | 64 |
|