1. Achuthan, N.R., L. Caccetta and S.P. Hill. (1995). An Improved Branch and Cut Algorithm for the Capacitated Vehicle Routing Problem. Technical report, School of Mathematics and Statistics, Curtin University of Technology, Perth, Australia.
2. Achuthan, N.R., L. Caccetta and S.P. Hill. (1996). A New Subtour Elimination Constraint for the Vehicle Routing Problem. European Journal of Operational Research, 91:573–586.
3. Agarwal, Y., K. Mathur and H.M. Salkin. (1989). A Set-Partitioning-Based Exact Algorithm for the Vehicle Routing Problem. Networks, 19:731–749.
4. Araque, J.R., G. Kudva, T.L. Morin and J.F. Pekny. (1994). A Branch-and-Cut for Vehicle Routing Problems. Annals of Operations Research, 50:37–59.
5. Augerat, P., J.M. Belenguer, E. Benavent, A. Corberán, D. Naddef and G. Rinaldi. (1995). Computational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem. Technical Report RR949-M, ARTEMIS-IMAG, Grenoble, France.