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...

We present a new model formulation for a multiproduct dynamic order quantity problem with product returns and a reprocessing option. The optimization considers the limited shelf life of sterile medical devices as well as the capacity constraints of reprocessing and sterilization resources. The...