1. Antoniadis, N., Sifaleras, A.: A hybrid CPU–GPU parallelization scheme of variable neighborhood search for inventory optimization problems. Electron. Not. Discrete Math. 58, 47–54 (2017)
2. Augerat, P., Belenguer, J., Benavent, E., Corberán, A., Naddef, D., Rinaldi, G.: Computational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem. Tech. Rep. 495, Institute for Systems Analysis and Computer Science (IASI), Rome (1995)
3. Baldacci, R., Toth, P., Vigo, D.: Exact algorithms for routing problems under vehicle capacity constraints. Ann. Oper. Res. 175(1), 213–245 (2010)
4. Christofides, N., Eilon, S.: An algorithm for the vehicle-dispatching problem. J. Oper. Res. Soc. 20(3), 309–318 (1969)
5. Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.) Combinatorial Optimization, vol. 1, Chap. 11, pp. 315–338. Wiley, Chichester (1979)