Geodesic
An asymptotically exact algorithm for the maximum-weight traveling salesman problem in a~finite-dimensional normed space
Diskretnyj analiz i issledovanie operacij, Tome 17 (2010) no. 4, pp. 84-91

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{DA_2010_17_4_a5,
     author = {V. V. Shenmaier},
     title = {An asymptotically exact algorithm for the maximum-weight traveling salesman problem in a~finite-dimensional normed space},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {84--91},
     publisher = {mathdoc},
     volume = {17},
     number = {4},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2010_17_4_a5/}
}
TY  - JOUR
AU  - V. V. Shenmaier
TI  - An asymptotically exact algorithm for the maximum-weight traveling salesman problem in a~finite-dimensional normed space
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2010
SP  - 84
EP  - 91
VL  - 17
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2010_17_4_a5/
LA  - ru
ID  - DA_2010_17_4_a5
ER  - 
%0 Journal Article
%A V. V. Shenmaier
%T An asymptotically exact algorithm for the maximum-weight traveling salesman problem in a~finite-dimensional normed space
%J Diskretnyj analiz i issledovanie operacij
%D 2010
%P 84-91
%V 17
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2010_17_4_a5/
%G ru
%F DA_2010_17_4_a5
V. V. Shenmaier. An asymptotically exact algorithm for the maximum-weight traveling salesman problem in a~finite-dimensional normed space. Diskretnyj analiz i issledovanie operacij, Tome 17 (2010) no. 4, pp. 84-91. http://geodesic.mathdoc.fr/item/DA_2010_17_4_a5/