|
Avtomatika i Telemekhanika, 1989, Issue 10, Pages 3–29
(Mi at6433)
|
|
|
|
This article is cited in 67 scientific papers (total in 67 papers)
Surveys
The traveling salesman's problem. Exact methods
I. I. Melamed, S. I. Sergeev, I. Kh. Sigal Moscow
Abstract:
An algorithm is discussed for optimal solution of the traveling salesman's problem. Dynamic programming methods, versions of the branch-and-bound method, Lagrangeans multiplier methods, sectioning planes method, and various combinations of these methods are discussed. Data of numerical experiments is provided.
Received: 17.10.1988
Citation:
I. I. Melamed, S. I. Sergeev, I. Kh. Sigal, “The traveling salesman's problem. Exact methods”, Avtomat. i Telemekh., 1989, no. 10, 3–29; Autom. Remote Control, 50:10 (1989), 1303–1324
Linking options:
https://www.mathnet.ru/eng/at6433 https://www.mathnet.ru/eng/at/y1989/i10/p3
|
Statistics & downloads: |
Abstract page: | 1520 | Full-text PDF : | 678 | First page: | 2 |
|