Subject
Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference120 articles.
1. Applegate, D., Bixby, R., Chvatal, V.,& Cook, W. (2006) The traveling salesman problem.
2. Applegate, D., Bixby, R., Chvatal, V., & Cook, W. (2015) National traveling salesman problems. http://www.math.uwaterloo.ca/tsp/world/countries.html.
3. A novel imperialist competitive algorithm for generalized traveling salesman problems;Ardalan;Applied Soft Computing,2015
4. Arora, S. (1998). Polynomial time approximation schemes for euclidean TSP and other geometric problems. Journal of ACM, 45, 5753–782
5. Ávila, T., Corberán, A., Plana, I.,& Sanchis, J. M. (2016) A branch-and-cut algorithm for the profitable windy rural postman problem. European Journal of Operational Research. 249, 3, 1092–1101,
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献