Geodesic
Polynomial algorithms with the estimates 3/4 and 5/ for the traveling salesman problem of the maximum
Diskretnyj analiz i issledovanie operacij, no. 26 (1985), pp. 55-59 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{DA_1985_26_a4,
     author = {A. V. Kostochka and A. I. Serdyukov},
     title = {Polynomial algorithms with the estimates 3/4 and 5/ for the traveling salesman problem of the maximum},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {55--59},
     year = {1985},
     number = {26},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_1985_26_a4/}
}
TY  - JOUR
AU  - A. V. Kostochka
AU  - A. I. Serdyukov
TI  - Polynomial algorithms with the estimates 3/4 and 5/ for the traveling salesman problem of the maximum
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 1985
SP  - 55
EP  - 59
IS  - 26
UR  - http://geodesic.mathdoc.fr/item/DA_1985_26_a4/
LA  - ru
ID  - DA_1985_26_a4
ER  - 
%0 Journal Article
%A A. V. Kostochka
%A A. I. Serdyukov
%T Polynomial algorithms with the estimates 3/4 and 5/ for the traveling salesman problem of the maximum
%J Diskretnyj analiz i issledovanie operacij
%D 1985
%P 55-59
%N 26
%U http://geodesic.mathdoc.fr/item/DA_1985_26_a4/
%G ru
%F DA_1985_26_a4
A. V. Kostochka; A. I. Serdyukov. Polynomial algorithms with the estimates 3/4 and 5/ for the traveling salesman problem of the maximum. Diskretnyj analiz i issledovanie operacij, no. 26 (1985), pp. 55-59. http://geodesic.mathdoc.fr/item/DA_1985_26_a4/