The shortest-path problem with resource constraints with (k,2) ( k , 2 ) -loop elimination and its application to the capacitated arc-routing problem
New dynamic programming labeling algorithm for SPPRC. Relevant for solving arc-routing problems (CARP) with branch-and-price. Handling loop elimination for two independent task sets. Some knowingly hard CARP instances were solved to optimality for the first time.
capacitated arc-routing problem constrained shortest paths cycle elimination