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

Ahuja, 1993 Beasley, 1989, An algorithm for the resource constrained shortest path problem, Networks, 19, 379, 10.1002/net.3230190402 Boland, 2006, Accelerated label setting algorithms for the elementary resource constrained shortest path problem, Operations Research Letters, 34, 58, 10.1016/j.orl.2004.11.011 J. Bramel, D. Simchi-Levi, Set-covering-based algorithms for the capacitated VRP, in: P. Toth, D. Vigo (Eds), The Vehicle Routing Problem, in: SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 2002 Desaulniers, 1998, A unified framework for deterministic time constrained Vehicle Routing and crew scheduling Problems, 57 Desrochers, 1988, A generalized permanent labelling algorithm for the shortest path problem with time windows, INFOR, 26, 191 Desrosiers, 1995, Time constrained routing and scheduling in Network Routing, 10.1016/S0927-0507(05)80106-9 Desrosiers, 1983, Plus court chemin avec contraintes d’horaires, RAIRO, 17, 357, 10.1051/ro/1983170403571 Dror, 1994, Note on the complexity of the shortest path models for column generation in VRPTW, Operations Research, 42, 977, 10.1287/opre.42.5.977 Dumitrescu, 2003, Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem, Networks, 42, 135, 10.1002/net.10090 Feillet, 2004, An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems, Networks, 44, 216, 10.1002/net.20033 S. Irnich, G. Desaulniers, Shortest path problems with resource constraints, Cahier du GERAD G-2004-11, Université de Montréal, 2004 Mehlhorn, 2000, Resource constrained shortest paths, Lecture Notes in Computer Science, 1879, 326, 10.1007/3-540-45253-2_30