1. E. Bonomi and J.L. Lutton, “Then-city travelling salesman problem: Statistical mechanics and the metropolis algorithm,”SIAM Review 26 (1984) 551–568.
2. R.M. Karp, “The probabilistic analysis of some combinatorial search algorithms,” in: J. F. Traub, ed.,Algorithms and Complexity (Academic Press, New York, 1976).
3. S. Lin, B.W. Kernighan, “An effective heuristic algorithm for the travelling salesman problem,”Operations Research 21 (1973) 498–516.
4. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys,The Traveling Salesman Problem (John Wiley, Chichester 1985).
5. Th.M. Liebling, Y. Rossier and M. Troyon, “Probabilistic exchange algorithms and euclidean travelling salesman problems,” RO851125, Department of Mathematics EPF Lausanne, Switzerland (1985).