Answers are grounded in this paper and cite their sources.
In this note we prove that the relaxation approach in designing the subproblem of pricing out only the feasible routes for the set partition formulation of the VRPTW is justified on complexity grounds. That is, the first dynamic programming model presented in M. Desrochers, J. Desrosiers and M. Solomon (1992), that is able to price out all feasible routes, is NP-hard in the strong sense.
No takes yet. Share an insight, caveat, or question.
Moshe Dror (1994) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: