|
Avtomatika i Telemekhanika, 1989, Issue 9, Pages 3–33
(Mi at6414)
|
|
|
|
This article is cited in 77 scientific papers (total in 77 papers)
Surveys
The traveling salesman problem. Issues in theory
I. I. Melamed, S. I. Sergeev, I. Kh. Sigal Moscow
Abstract:
The first part of the paper surveys the theoretical results in solving the traveling salesman problem. Various (combinatorial, graph-theoretic, etc.) descriptions and linear and integer linear programming statements of the problem are provided. Actual problems reducible to the traveling salesman problem are described in detail. The computing complexity of the problem, the existence of a Hamiltonian cycle (loop), and numerous varieties of the problem are discussed.
Received: 17.10.1988
Citation:
I. I. Melamed, S. I. Sergeev, I. Kh. Sigal, “The traveling salesman problem. Issues in theory”, Avtomat. i Telemekh., 1989, no. 9, 3–33; Autom. Remote Control, 50:9 (1989), 1147–1173
Linking options:
https://www.mathnet.ru/eng/at6414 https://www.mathnet.ru/eng/at/y1989/i9/p3
|
Statistics & downloads: |
Abstract page: | 1885 | Full-text PDF : | 986 | First page: | 2 |
|