Article ID: | iaor20083820 |
Country: | Netherlands |
Volume: | 175 |
Issue: | 1 |
Start Page Number: | 210 |
End Page Number: | 223 |
Publication Date: | Nov 2006 |
Journal: | European Journal of Operational Research |
Authors: | Lysgaard Jens |
This paper introduces a class of cuts, called reachability cuts, for the Vehicle Routing Problem with Time Windows (VRPTW). Reachability cuts are closely related to cuts derived from precedence constraints in the Asymmetric Traveling Salesman Problem with Time Windows and to