|
|
Diskretnyi Analiz i Issledovanie Operatsii, 2010, Volume 17, Issue 4, Pages 84–91
(Mi da619)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
An asymptotically exact algorithm for the maximum-weight traveling salesman problem in a finite-dimensional normed space
V. V. Shenmaier S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia
Abstract:
The algorithm generalizes the well-known A. Serdyukov's algorithm for the euclidean MAX TSP. The algorithm is asymptotically exact in the case of an arbitrary finite-dimensional normed space. Ill. 4, bibliogr. 6.
Keywords:
MAX TSP, geometric traveling salesman problem, finite-dimensional normed space, asymptotically exact algorithm.
Received: 28.12.2009 Revised: 06.03.2010
Citation:
V. V. Shenmaier, “An asymptotically exact algorithm for the maximum-weight traveling salesman problem in a finite-dimensional normed space”, Diskretn. Anal. Issled. Oper., 17:4 (2010), 84–91
Linking options:
https://www.mathnet.ru/eng/da619 https://www.mathnet.ru/eng/da/v17/i4/p84
|
| Statistics & downloads: |
| Abstract page: | 483 | | Full-text PDF : | 157 | | References: | 72 | | First page: | 6 |
|