1. Sergeeev, S.I., The Symmetric Travelling Salesman Problem I. New Fast Lower Bounds for the Problem of Optimal 2-matching, Autom. Remote Control, 2009, no. 11, pp. 1901–1912.
2. Krotov, V.F. and Sergeev, S.I., Computing Algorithms for Solving Certain Problems in Linear and Linear Integer Programming. I–IV, Autom. Remote Control, 1980, no. 12, pp. 1693–1701; 1981, no. 1, pp. 67–75; no. 3, pp. 339–349; no. 4, pp. 494–500.
3. Balas, E. and Christofides, N., A Restricted Lagrangean Approach to the Traveling Salesman Problem, Math. Program., 1981, no. 1, pp. 19–46.
4. The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization, Lawler, E.L., Lenstra, J.K., Rinnoy Kan, A.H.G., and Shmoys, D.B., Eds., New York: Wiley, 1985.
5. Melamed, I.I., Sergeev, S.I., and Sigal, I.Kh., The Traveling Salesman Problem. I–III, Autom. Remote Control, 1989, no. 9, part 1, pp. 1147–1173; no. 10, part 1, pp. 1303–1324; no. 11, part 1, pp. 1459–1479.