1. Gutin, G. and Punnen, A., The Traveling Salesman Problem and Its Variations, Berlin: Springer, 2002.
2. Cook, W.J., In Pursuit of the Traveling Salesman. Mathematics at the Limits of Computation, Princeton: Princeton University Press, 2012.
3. Gimadi, E.Kh. and Khachai, M.Yu., Ekstremal’nye zadachi na mnozhestvakh perestanovok (Extremal Problems on Permutation Sets), Yekaterinburg: UPI Training Center, 2016.
4. Melamed, I.I., Sergeev, S.I., and Sigal, I.Kh., The Traveling Salesman Problem, Autom. Remote Control, 1989, vol. 50, no. 9, pp. 1147–1173; no. 10, pp. 1303–1324; no. 11, pp. 1459–1479.
5. Little, J.D., Murty, K.G., Sweeney, D.W., and Karel, C., An Algorithm for the Traveling Salesman Problem, Oper. Res., 1963, no. 11(6), pp. 972–989.