Sciweavers

Share
ENDM
2010

On the Vehicle Routing Problem with lower bound capacities

8 years 5 months ago
On the Vehicle Routing Problem with lower bound capacities
In this paper we show and discuss a family of inequalities for solving a variant of the classical vehicle routing problem where also a lower bound is considered. The inequalities are related to the projected inequalities from a single commodity flow formulation. Other inequalities are based on rounding procedures. We also show computational experiments proving the utility of the new inequalities.
Luís Gouveia, Juan José Salazar Gonz
Added 17 May 2011
Updated 17 May 2011
Type Journal
Year 2010
Where ENDM
Authors Luís Gouveia, Juan José Salazar González
Comments (0)
books