Author:
Dogan Onur,Alkaya Ali Fuat
Publisher
Springer International Publishing
Reference12 articles.
1. Pedro, O., Saldanha, R., Camargo, R.: A Tabu search approach for the prize collecting traveling salesman problem. Electron. Notes Discrete Math. 41, 261–268 (2013)
2. Bar-Yehuda, R., Even, G., Shahar, S.(Moni).: On approximating a geometric prize-collecting traveling salesman problem with time windows. J. Algorithms 55(1), 76–92 (2005)
3. Wang, S., Rao, W., Hong, Y.: A distance matrix based algorithm for solving the traveling salesman problem. Oper. Res. 20(3), 1–38 (2020)
4. Couto, B.: Using Matrices and Hungarian Method to Solve the Traveling Salesman Problem, p. 169. Honors Theses (2018)
5. Janusz, C.: An application of the Hungarian algorithm to solve traveling salesman problem. Am. J. Comput. Math. 09(02), 61–67 (2019)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献