Efficient itinerary planning with category constraints
- 4 November 2014
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Abstract
No abstract availableFunding Information
- INTERREG IV project O-STAR (5343)
This publication has 14 references indexed in Scilit:
- A survey on algorithmic approaches for solving tourist trip design problemsJournal of Heuristics, 2014
- Parameterized algorithms for generalized traveling salesman problems in road networksPublished by Association for Computing Machinery (ACM) ,2013
- Trip-Mine: An Efficient Trip Planning Approach with Travel Time ConstraintsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2011
- Decremental state space relaxation strategies and initialization heuristics for solving the Orienteering Problem with Time Windows with dynamic programmingComputers & Operations Research, 2009
- Approximation Algorithms for Orienteering and Discounted-Reward TSPSIAM Journal on Computing, 2007
- Variable Neighborhood Search for the Orienteering ProblemLecture Notes in Computer Science, 2006
- Using artificial neural networks to solve the orienteering problemAnnals of Operations Research, 1995
- An Optimal Algorithm for the Orienteering Tour ProblemINFORMS Journal on Computing, 1992
- Algorithms to solve the orienteering problem: A comparisonEuropean Journal of Operational Research, 1989
- Heuristic Methods Applied to OrienteeringJournal of the Operational Research Society, 1984