Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints

@article{Righini2006SymmetryHB,
  title={Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints},
  author={Giovanni Righini and Matteo Salani},
  journal={Discrete Optimization},
  year={2006},
  volume={3},
  pages={255-273}
}
When vehicle routing problems with additional constraints, such as capacity or time windows, are solved via column generation and branch-and-price, it is common that the pricing subproblem requires the computation of a minimum cost constrained path on a graph with costs on the arcs and prizes on the vertices. A common solution technique for this problem is dynamic programming. In this paper we illustrate how the basic dynamic programming algorithm can be improved by bounded bi-directional… CONTINUE READING
Highly Influential
This paper has highly influenced 15 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 89 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Set-covering-based algorithms for the capacitated VRP

  • J. Bramel, D. Simchi-Levi
  • in: P. Toth, D. Vigo (Eds), The Vehicle Routing…
  • 2002
1 Excerpt

A unified framework for deterministic time constrained Vehicle Routing and crew scheduling Problems

  • G. Desaulniers, J. Desrosiers, I. Ioachim, M. M. Solomon, F. Soumis, D. Villeneuve
  • in: T.G. Crainic, G. Laporte (Eds.), Fleet…
  • 1998
1 Excerpt

Time constrained routing and scheduling in Network Routing

  • J. Desrosiers, Y. Dumas, M. Solomon, F. Soumis
  • in: M.O. Ball et al. (Eds.), Handbooks in…
  • 1995
2 Excerpts

Network Flows

  • R. K. Ahuja, T. L. Magnanti, J. B. Orlin
  • Prentice Hall
  • 1993
1 Excerpt

Similar Papers

Loading similar papers…