| Article ID: | iaor1993551 |
| Country: | Netherlands |
| Volume: | 52 |
| Issue: | 1 |
| Start Page Number: | 75 |
| End Page Number: | 85 |
| Publication Date: | May 1991 |
| Journal: | European Journal of Operational Research |
| Authors: | Campos V., Corberan A., Mota E. |
The Vehicle Routing Problem is a well known, and hard, combinatorial problem, whose polyhedral structure has deserved little attention. In this paper the authors consider the particular case in which all the demands are equal (since in the general case the associated polytope may be empty). From a known formulation of the problem they obtain the dimension of the corresponding polytope and study the facetial properties of every inequality in it.