Decremental state space relaxation strategies and initialization heuristics for solving the Orienteering Problem with Time Windows with dynamic programming
- 30 April 2009
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 36 (4), 1191-1203
- https://doi.org/10.1016/j.cor.2008.01.003
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- New dynamic programming algorithms for the resource constrained elementary shortest path problemNetworks, 2007
- Accelerated label setting algorithms for the elementary resource constrained shortest path problemOperations Research Letters, 2006
- Traveling Salesman Problems with ProfitsTransportation Science, 2005
- A branch-and-cut algorithm for the undirected selective traveling salesman problemNetworks, 1998
- Solving the Orienteering Problem through Branch-and-CutINFORMS Journal on Computing, 1998
- The traveling salesman problem: An overview of exact and approximate algorithmsEuropean Journal of Operational Research, 1992
- The Orienteering Problem with Time WindowsJournal of the Operational Research Society, 1992
- An Optimal Algorithm for the Orienteering Tour ProblemINFORMS Journal on Computing, 1992
- The orienteering problemNaval Research Logistics (NRL), 1987
- Heuristic Methods Applied to OrienteeringJournal of the Operational Research Society, 1984