Preprint Università degli Studi di Milano, 2006

Dynamic programming for the orienteering problem with time windows

Giovanni Righini · Matteo Salani

Paper

Abstract

This technical report develops dynamic programming algorithms for the orienteering problem with time windows, where a subset of vertices must be visited within time windows to maximize collected rewards. Bi-directional dynamic programming and state space relaxation techniques are explored.

Dynamic ProgrammingOrienteering ProblemCombinatorial Optimization

BibTeX

@article{righini2006dynamic,
  title={Dynamic programming for the orienteering problem with time windows},
  author={Righini, Giovanni and Salani, Matteo},
  year={2006},
  publisher={Universit{\`a} degli Studi di Milano-Polo Didattico e di Ricerca di Crema}
}