1. Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Berlin, Heidelberg (2006)
2. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley (1985)
3. Augerat, P., Naddef, D., Belenguer, J.M., Benavent, E., Corberan, A., Rinaldi, G.: Computational results with a branch and cut code for the capacitated vehicle routing problem. France: N. p (1995)
4. Melamed, I.I., Sigal, I.K.H.: The linear convolution of criteria in the bicriteria traveling salesman problem. Comput. Math. Math. Phys. 37, 8 (1997)
5. Christofides, N., Mingozzi, A., Toth, P.: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math Prog 20, 255–282 (1981). https://doi.org/10.1007/BF01589353