Geodesic
An asymptotically exact algorithm for the traveling salesman problem for a maximum in Euclidean space
Diskretnyj analiz i issledovanie operacij, no. 27 (1987), pp. 79-87.

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

@article{DA_1987_27_a5,
     author = {A. I. Serdyukov},
     title = {An asymptotically exact algorithm for the traveling salesman problem for a maximum in {Euclidean} space},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {79--87},
     publisher = {mathdoc},
     number = {27},
     year = {1987},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_1987_27_a5/}
}
TY  - JOUR
AU  - A. I. Serdyukov
TI  - An asymptotically exact algorithm for the traveling salesman problem for a maximum in Euclidean space
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 1987
SP  - 79
EP  - 87
IS  - 27
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_1987_27_a5/
LA  - ru
ID  - DA_1987_27_a5
ER  - 
%0 Journal Article
%A A. I. Serdyukov
%T An asymptotically exact algorithm for the traveling salesman problem for a maximum in Euclidean space
%J Diskretnyj analiz i issledovanie operacij
%D 1987
%P 79-87
%N 27
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_1987_27_a5/
%G ru
%F DA_1987_27_a5
A. I. Serdyukov. An asymptotically exact algorithm for the traveling salesman problem for a maximum in Euclidean space. Diskretnyj analiz i issledovanie operacij, no. 27 (1987), pp. 79-87. http://geodesic.mathdoc.fr/item/DA_1987_27_a5/