Showing 1 - 10 of 89
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...
Persistent link: https://www.econbiz.de/10015333151
Persistent link: https://www.econbiz.de/10008841175
Persistent link: https://www.econbiz.de/10011287506
Persistent link: https://www.econbiz.de/10011453820
Persistent link: https://www.econbiz.de/10011890192
Persistent link: https://www.econbiz.de/10011737981
Persistent link: https://www.econbiz.de/10011707141
Persistent link: https://www.econbiz.de/10011811802
Persistent link: https://www.econbiz.de/10012631648
Persistent link: https://www.econbiz.de/10012102595