1. A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem;Ahuja;Operations Research Letters,2003
2. Amberg, A., Domschke, W., Voss, S., 1996. Capacitated minimum spanning trees: algorithms using intelligent search. In: Combinatorial Optimization: Theory and Practice, pp. 9–39.
3. Augerat, P., Belenguer, J.M., Benavent, E., Corberan, A., Naddef, D., Rinaldi, G., 1995. Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical Report RR 949-M, University Joseph Fourier, Grenoble, France.
4. A unified exact method for solving different classes of vehicle routing problems;Baldacci;Mathematical Programming,2009
5. Routing a Heterogeneous Fleet of Vehicles;Baldacci,2008