Journal Electronic Notes in Discrete Mathematics, 2004

Dynamic programming algorithms for the elementary shortest path problem with resource constraints

Giovanni Righini · Matteo Salani

Paper

Abstract

We present dynamic programming algorithms for the elementary shortest path problem with resource constraints (ESPPRC). The algorithms exploit bi-directional search and dominance criteria to efficiently compute optimal paths, with applications to pricing in vehicle routing branch-and-price methods.

Dynamic ProgrammingShortest PathVehicle Routing

BibTeX

@article{righini2004dynamic,
  title={Dynamic programming algorithms for the elementary shortest path problem with resource constraints},
  author={Righini, Giovanni and Salani, Matteo},
  journal={Electronic Notes in Discrete Mathematics},
  volume={17},
  pages={247--249},
  year={2004},
  publisher={Elsevier}
}