This article is cited 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.

UDC: 519.176

Received: 28.12.2009
Revised: 06.03.2010

Bibliographic databases:

• 
•