1. Little, J.D.C., Murty, K.G., Sweeney, D.W., and Karel, C., An Algorithm for the Traveling Salesman Problem, Oper. Res., 1963, no. 11, pp. 972–989.
2. Land, A.H. and Doig, A.G., An Automatic Method of Solving Discrete Programming Problems, Econometrica, 1960, vol. 28, no. 3, pp. 497–520.
3. Goodman, S.R. and Hedetniemi, S.T., Introduction to the Design and Analysis of Algorithms, New York: McGraw-Hill, 1977. Translated under the title Vvedenie v razrabotku i analiz algoritmov, Moscow: Mir, 1981.
4. Korte, B. and Vygen, J., Combinatorial Optimization: Theory and Algorithms, Berlin: Springer, 2007.
5. Matai, R., Mittal, M.L., and Singh, S., Travelling Salesman Problem: An Overview of Applications, Formulations and Solution Approaches, in Travelling Salesman Problem: Theory and Applications, Davendra, D., Ed., Rijeka: Intech Open Access Publisher, 2010, pp. 1–24.