Author:
Stanojević Milan,Stanojević Bogdana
Reference39 articles.
1. Altinel, I.K., & Öncan, T. (2005). A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem. Journal of the Operational Research Society, 56(8), 954–961. doi: 10.1057/palgrave.jors.2601916.
2. Augerat, P., Belenguer, J.M., Benavent, E., Corberán, A., Naddef, D., & Rinaldi, G. (1995). Computational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem. Research Report 949-M, Universite Joseph Fourier, Grenoble, France.
3. Baldacci, R., Battara, M., & Vigo, D. (2008). Routing a heterogeneous fleet of vehicles, in: B. Golden, S. Raghavan, and E. Wasil (eds), The Vehicle Routing Problem — Latest Advanced and New Challenges, Springer, 3–28.
4. Baldacci, R., & Mingozzi, A. (2009) A unified exact method for solving different classes of vehicle routing problems, Mathematical Programming, 120(2), 347–380. doi: 10.1007/s10107-008-0218-9.
5. Balinski, M., & Quandt, R. (1964). On an integer program for a delivery problem, Operations Research, 12, 300–304.