Polynomial-time separation of Enhanced Reverse Multistar inequalities

The Vehicle Routing Problem with a minimum number of customers per route concerns the Capacitated Vehicle Routing Problem with unit-demand customers and a lower bound on the number of customers visited by each vehicle. This paper answers two open questions in the article (Gouveia et al., in press) [5]: finding a compact formulation for the problem such that the corresponding linear programming relaxation implies the Enhanced Reverse Multistar inequalities, and finding a polynomial-time separation algorithm for this class of inequalities.