Journal Networks: An International Journal, 2008

New dynamic programming algorithms for the resource constrained elementary shortest path problem

Giovanni Righini · Matteo Salani

Paper

Abstract

We present new dynamic programming algorithms for the resource constrained elementary shortest path problem, improving on previous bi-directional approaches through new dominance criteria and bounding techniques. These algorithms are particularly useful as pricing routines in branch-and-price methods for vehicle routing problems.

Dynamic ProgrammingVehicle RoutingCombinatorial Optimization

BibTeX

@article{righini2008new,
  title={New dynamic programming algorithms for the resource constrained elementary shortest path problem},
  author={Righini, Giovanni and Salani, Matteo},
  journal={Networks: An International Journal},
  volume={51},
  number={3},
  pages={155--170},
  year={2008},
  publisher={Wiley Subscription Services, Inc., A Wiley Company Hoboken}
}