1. Applegate, D., Bixby, R. E., Chvátal, V., & Cook, W. (2006). The traveling salesman problem: a computational study. New Jersey: Princeton University Press.
2. Baldacci, R., & Mingozzi, A. (2009). A unified exact method for solving different classes of vehicle routing problems. Mathematical Programming Series A, 120(2), 347–380.
3. Bektas, T. (2006). The multiple traveling salesman problem: an overview of formulations and solution procedures. The International Journal of Management Science, 34, 1449–1458.
4. Belenguer, J. M., Benavent, E., Prins, C., Prodhon, C., & Wolfler-Calvo, R. (2011). A branch and cut method for the capacitated location-routing problem. Computers & Operations Research, 8(6), 931–941.
5. Benavent, E., & Martínez, A. (2011). A polyhedral study of the multi-depot multiple TSP. Internal report, Universitát de Valencia. http://www.uv.es/~benavent/MDMTSP/report_MDMTSP.pdf .