1. Laporte, G.: The traveling salesman problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(2), 231–247 (1992)
2. Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: A case study in local optimization. Local Search Comb. Optim. 1, 215–310 (1997)
3. Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press (2011)
4. Garey, M.R., Johnson, D.S.: A Guide to the Theory of np-Completeness, p 70. WH Freemann, New York (1979)
5. Glover, F.: Tabu search—part i. ORSA J. Comput. 1(3), 190–206 (1989)