The primal adjacency-based algorithm and the multi-directional dynamic programming algorithm are two exact methods that have recently been developed to effic...

The shortest path problem with resource constraints finds the least cost path between two nodes in a network while respecting constraints on resource consump...

The shortest path problem with resource constraints (SPPRC) is often used as a subproblem within a column generation approach for routing and scheduling prob...