1. Applegate D, Bixby R, Chvátal V, Cook W (1994) Special session on tsp. In: 15th International Symposium on Mathematical Programming. University of Michigan, USA
2. Araque JR, Hall L, Magnanti T (1990) Capacitated trees, capacitated routing and associated polyhedra. Technical Report Discussion Paper 9061, CORE, Louvain La Nueve
3. Augerat P (1995) Approche polyèdrale du problème de tournées de véhicules. PhD thesis, Institut National Polytechnique de Grenoble
4. Augerat P, Belenguer JM, Benavent E, Corberán A, Naddef D, Rinaldi G (1995) Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical Report 1 RR949-M, ARTEMIS-IMAG, Grenoble France
5. Augerat P, Belenguer JM, Benavent E, Corberán A and Naddef D (1998). Separating capacity constraints in the CVRP using tabu search. Euro J Oper Res 106: 546–557