Funder
National Research Foundation of Korea
MEST
Subject
General Engineering,General Computer Science
Reference42 articles.
1. Team orienteering problem with decreasing profits;Afsar;Electronic Notes in Discrete Mathematics,2013
2. Aksen, D., & Shahmanzari, M. (2018). A periodic traveling politician problem with time-dependent rewards. In: Fink A., Fügenschuh A., Geiger M. (Eds.), Operations Research Proceedings 2016, 277–283. https://doi.org/10.1007/978-3-319-55702-1_37.
3. A 3-opt based simulated annealing algorithm for vehicle routing problems;Alfa;Computers & Industrial Engineering,1991
4. The set orienteering problem;Archetti;European Journal of Operational Research,2018
5. The capacitated team orienteering and profitable tour problems;Archetti;Journal of the Operational Research Society,2009
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献