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.