|
Avtomatika i Telemekhanika, 1989, Issue 11, Pages 3–26
(Mi at6463)
|
|
|
|
This article is cited in 66 scientific papers (total in 66 papers)
Surveys
The traveling salesman problem. Approximate algorithms
I. I. Melamed, S. I. Sergeev, I. Kh. Sigal Moscow
Abstract:
This third part of the survey covers a way to develop and estimate the efficiency of heuristic algorithms for solution of the traveling salesman problem. Data is given on the worst behavior of the algorithms. Results of computing experiments are extended. Interactive and hybrid algorithms and methods to solve high dimension problems are discussed.
Received: 17.10.1988
Citation:
I. I. Melamed, S. I. Sergeev, I. Kh. Sigal, “The traveling salesman problem. Approximate algorithms”, Avtomat. i Telemekh., 1989, no. 11, 3–26; Autom. Remote Control, 50:11 (1989), 1459–1479
Linking options:
https://www.mathnet.ru/eng/at6463 https://www.mathnet.ru/eng/at/y1989/i11/p3
|
Statistics & downloads: |
Abstract page: | 1391 | Full-text PDF : | 549 | First page: | 2 |
|