Funder
Air Force Office of Scientific Research
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Control and Optimization
Reference22 articles.
1. Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: Concorde. Available at: http://www.math.uwaterloo.ca/tsp/concorde/index.html (2003)
2. Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton, New Jersey, USA (2006)
3. Behdani, B., Smith, J.C.: An integer-programming-based approach to the close-enough traveling salesman problem. INFORMS J. Comput. 26(3), 415–432 (2014)
4. Carrabs, F., Cerrone, C., Cerulli, R., D’Ambrosio, C.: Improved upper and lower bounds for the close enough traveling salesman problem. In: International Conference on Green, Pervasive, and Cloud Computing, Springer, pp 165–177 (2017a)
5. Carrabs, F., Cerrone, C., Cerulli, R., Gaudioso, M.: A novel discretization scheme for the close enough traveling salesman problem. Comput. Op. Res. 78, 163–171 (2017)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献