Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,Computer Science Applications,Information Systems,Management Information Systems
Reference26 articles.
1. Applegate, D., Cook, W., Rohe, A.: Chained Lin–Kernighan for large traveling salesman problems. INFORMS J. Comput. 15, 82–92 (2003)
2. Basu, S.: Neighborhood reduction strategy for Tabu search implementation in asymmetric traveling salesman problem. Opsearch 49(4), 400–412 (2012).
https://doi.org/10.1007/s12597-012-0086-1
3. Basu, S., Gajulapalli, R.S., Ghosh, D.: A fast Tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs. Opsearch 50(1), 75–88 (2013).
https://doi.org/10.1007/s12597-012-0088-z
4. Cook, W.: The traveling salesman problem, Department of Combinatorics and Optimization at the University of Waterloo, Canada (website)
http://www.math.uwaterloo.ca/tsp/index.html
. Accessed 26 June 2018
5. Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling-salesman problem. J. Oper. Res. Soc. Am. 2(4): 393–410 (1954). INFORMS,
http://www.jstor.org/stable/166695
, Accessed: 06 June 2018
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献