1. Johnson DS, Garey MR (1979) Computers and intractability: a guide to the theory of NP-completeness. WH Freeman
2. Pardalos LY, Resende MGC (1994) A greedy randomized adaptive search procedure for the quadratic assignment problem. Quad Assign Relat Problem DIMACS Seri Discr Math Theoret Comput Sci 16:237–261
3. Applegate DL, Bixby RE, Chvatal V, Cook WJ (2006) The traveling salesman problem: a computational study. Princeton University Press
4. Stützle T, Dorigo M et al (1999) ACO algorithms for the traveling salesman problem. In: Evolutionary algorithms in engineering and computer science, pp 163–183
5. Donald D (2010) Traveling salesman problem, theory and applications. INTECH Open Access Publisher