Geodesic
A sequence for using algorithms for the approximate solution in the hybrid algorithm for solving the travelling salesman problem
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 29 (1989) no. 11, pp. 1714-1721

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

@article{ZVMMF_1989_29_11_a9,
     author = {I. Kh. Sigal},
     title = {A sequence for using algorithms for the approximate solution in the hybrid algorithm for solving the travelling salesman problem},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1714--1721},
     publisher = {mathdoc},
     volume = {29},
     number = {11},
     year = {1989},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1989_29_11_a9/}
}
TY  - JOUR
AU  - I. Kh. Sigal
TI  - A sequence for using algorithms for the approximate solution in the hybrid algorithm for solving the travelling salesman problem
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1989
SP  - 1714
EP  - 1721
VL  - 29
IS  - 11
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1989_29_11_a9/
LA  - ru
ID  - ZVMMF_1989_29_11_a9
ER  - 
%0 Journal Article
%A I. Kh. Sigal
%T A sequence for using algorithms for the approximate solution in the hybrid algorithm for solving the travelling salesman problem
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1989
%P 1714-1721
%V 29
%N 11
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZVMMF_1989_29_11_a9/
%G ru
%F ZVMMF_1989_29_11_a9
I. Kh. Sigal. A sequence for using algorithms for the approximate solution in the hybrid algorithm for solving the travelling salesman problem. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 29 (1989) no. 11, pp. 1714-1721. http://geodesic.mathdoc.fr/item/ZVMMF_1989_29_11_a9/