1. Augerat, P., Belenguer, J., Benavent, E., Corberán, A., Naddef, D., & Rinaldi, G. (1995). Computational results with a branch and cut code for the capacitated vehicle routing problem. Tech. Rep. 949-M, Université Joseph Fourier, Grenoble, France.
2. Baldacci, R., & Maniezzo, V. (2004). Exact methods based on node routing formulations for arc routing problems. Tech. Rep. UBLCS-2004-10, Department of Computer Science, University of Bologna, Bologna, Italy, available at http://www.informatica.unibo.it/it/ricerca/technical-report/2004/pdfs/2004-10.pdf
3. Baldacci, R., & Maniezzo, V. (2006). Exact methods based on node-routing formulations for undirected arc-routing problems. Networks, 47, 52–60.
4. Baldacci, R., Christofides, N., & Mingozzi, A. (2008). An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Mathematical Programming, 115, 351–385.
5. Benavent, E., Campos, V., Corberan, A., & Mota, E. (1992). The capacitated arc routing problem: Lower bounds. Networks, 22, 669–690.