1. Araque, J., Hall, L., & Magnanti, T. (1990). Capacitated trees, capacitated routing and associated polyhedra. Discussion paper, Centre for Operations Research and Econometrics, Catholic University of Louvain, Belgium.
2. Computational results with branch-and-cut code for the capacitated vehicle routing problem;Augerat;Research report RR949-M,1995
3. Separating capacity constraints in the CVRP using tabu search;Augerat;European Journal of Operational Research,1998
4. Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing;Bektaş;European Journal of Operational Research,2012
5. A branch-and-cut algorithm for the single truck and trailer routing problem with satellite depots;Belenguer;Transportation Science,2016