Author:
Carrabs Francesco,Cerulli Raffaele,Festa Paola,Laureana Federica
Publisher
Springer International Publishing
Reference10 articles.
1. Bertsekas, D.P.: Dynamic Programming and Optimal Control, vol. I, 3rd edn. Athena Scientific (2005)
2. Artmeier, A., Haselmayr, J., Leucker, M., Sachenbacher, M.: The shortest path problem revisited: optimal routing for electric vehicles. In: Proceedings of the KI 2010, Advances in Artificial Intelligence, 33rd Annual German Conference on AI, Karlsruhe, Germany, pp. 309–316, 21–24 Sept 2010. Springer, Berlin, Heidelberg
3. Carrabs, F., Cerrone, C., Cerulli, R., Gaudioso, M.: A novel discretization scheme for the close enough traveling salesman problem. Computers & OR 78, 163–171 (2017)
4. Carrabs, F., Cerulli, R., Cerrone, C., D’Ambrosio, C.: Improved upper and lower bounds for the close enough traveling salesman problem, Green, Pervasive, and Cloud Computing. In: Proceedings of the 12th International Conference, GPC 2017, Cetara, Italy, pp. 165–177, 11–14 May 2017. Springer International Publishing (2017)
5. Festa, P.: Complexity analysis and optimization of the shortest path tour problem. Optim. Lett. 6(1), 163–175 (2012)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献