Article ID: | iaor20021741 |
Country: | United States |
Volume: | 48 |
Issue: | 5 |
Start Page Number: | 801 |
End Page Number: | 810 |
Publication Date: | Sep 2000 |
Journal: | Operations Research |
Authors: | Mota E., Belenguer J.M., Martinez M.C. |
Keywords: | transportation: general |
In this paper we consider the Split Delivery Vehicle Routing Problem (SDVRP), a relaxation of the known Capacitated Vehicle Routing Problem in which the demand of any client can be serviced by more than one vehicle. We define a feasible solution of this problem, and we show that the convex hull of the associated incidence vectors is a polyhedron (