1. M. Garey and D. Jonson, Computers and Intractability: A Guide to the Theory of NP-Completeness [Russian translation], Mir, Moscow (1982).
2. Ch. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity [Russian translation], Mir, Moscow (1985).
3. I. V. Sergienko and V. P. Shilo, Discrete Optimization Problems: Issues, Solution Methods, and Investigations [in Russian], Naukova Dumka, Kyiv (2003).
4. E. I. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, The Traveling Salesman Problem, Wiley, Chichester (1983).
5. V. M. Demidenko, “A special case of traveling salesman problems,” Vestsi Akad. Navuk Belarus. SSR, No. 5, 28–32 (1976).