Faldum, Stefan; Machate, Sarah; Gschwind, Timo; Irnich, … - In: OR Spectrum 46 (2024) 4, pp. 1063-1097
Abstract For many variants of vehicle routing and scheduling problems solved by a branch-price-and-cut (BPC) algorithm, the pricing subproblem is an elementary shortest-path problem with resource constraints (SPPRC) typically solved by a dynamic-programming labeling algorithm. Solving the SPPRC...