Volume 17, No 4, 2010, P. 8491
UDC 519.176
V. V. Shenmaier
An asymptotically exact algorithm for the maximumweight traveling salesman problem in a finitedimensional normed space
Abstract:
The algorithm generalizes the wellknown A. Serdyukov’s algorithm for the euclidean MAX TSP. The algorithm is asymptotically exact in the case of an arbitrary finitedimensional normed space.
ll. 4, bibliogr. 6.
Keywords: MAX TSP, geometric traveling salesman problem, finitedimensional normed space, asymptotically exact algorithm.
Shenmaier Vladimir Vladimirovich ^{1}
1. S. L. Sobolev Institute of Mathematics, SB RAS,
4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
email: shenmaier@mail.ru
