Geodesic
Approximate solution of the traveling salesman problem
Prikladnaâ diskretnaâ matematika, no. 1 (2009), pp. 72-78.

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

A heuristic algorithm for the approximate solution of traveling salesman problem is proposed in the article. 
@article{PDM_2009_1_a3,
     author = {V. I. Dulkeyt and R. T. Faizullin},
     title = {Approximate solution of the traveling salesman problem},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {72--78},
     publisher = {mathdoc},
     number = {1},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2009_1_a3/}
}
TY  - JOUR
AU  - V. I. Dulkeyt
AU  - R. T. Faizullin
TI  - Approximate solution of the traveling salesman problem
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2009
SP  - 72
EP  - 78
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2009_1_a3/
LA  - ru
ID  - PDM_2009_1_a3
ER  - 
%0 Journal Article
%A V. I. Dulkeyt
%A R. T. Faizullin
%T Approximate solution of the traveling salesman problem
%J Prikladnaâ diskretnaâ matematika
%D 2009
%P 72-78
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2009_1_a3/
%G ru
%F PDM_2009_1_a3
V. I. Dulkeyt; R. T. Faizullin. Approximate solution of the traveling salesman problem. Prikladnaâ diskretnaâ matematika, no. 1 (2009), pp. 72-78. http://geodesic.mathdoc.fr/item/PDM_2009_1_a3/

[1] Geri M, Dzhonson D., Vychislitelnye mashiny i trudnoreshaemye zadachi, Mir, M., 1982 | MR

[2] Ore O., Teoriya grafov, Nauka, M., 1980 | MR

[3] Faizulin R. T., Faizulin R. R., “Gladkie priblizheniya v zadache kommivoyazhëra”, Tavricheskii vestnik informatiki i matematiki, 2004, 27

[4] Skarboro D., Chislennye metody matematicheskogo analiza, GTTI, M., 1934

[5] Bakhvalov N. S., Zhidkov N. P., Kobelkov G. M., Chislennye metody, Laboratoriya Bazovykh Znanii, M., 2002

[6] http://www.iwr.uni-eidelberg.de/groups/comopt/software/TSPLIB95/tsp/