1. Applegate, D. L., Bixby, R. E., Chvátal, V., & Cook, W. J. (2006). The traveling salesman problem: A computational study. Princeton: Princeton University Press.
2. Araque, J. R., 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, J. M., 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, J. M., Benavent, E., Corberán, A., & Naddef, D. (1998). Separating capacity constraints in the CVRP using tabu search. European Journal of Operational Research, 106, 546–557.