Gotta (efficiently) catch them all: Pokémon GO meets Orienteering Problems.

European Journal of Operational Research(2018)

引用 7|浏览19
暂无评分
摘要
•Define the Generalized Clustered Orienteering Problem.•Polynomial-sized and exponential-sized mathematical formulations are presented.•A tailored exact algorithm is designed along with specially devised enhancements.•Real-world as well as state-of-the-art testbed instances are used.•Computational results show the effectiveness of the proposed approach.
更多
查看译文
关键词
Combinatorial optimization,Orienteering Problem,Generalized traveling salesman problem,Integer programming,Branch-and-cut
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要