Approximate solution of the traveling salesman problem
Prikladnaâ diskretnaâ matematika, no. 1 (2009), pp. 72-78
Citer cet article
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.
[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/