This paper presents an integer linear programming formulation for the symmetrical capacitated vehicle routing problem (CVRP). This formulation includes degree constraints, integrality constraints and subtour elimination constraints based on bin packing solutions. The bin packing solutions are also used to derive comb inequalities for the CVRP. Computational results are reported.
Paru en mars 1986 , 18 pages