1. E. Aarts and J.K. Lenstra, Local Search in Combinatorial Optimization, Wiley and Sons, 1997.
2. D. Applegate, R. Bixby, V. Chvatal, and W. Cook, “On the solution of traveling salesman problem,” Documenta Mathematica: Proc. Int. Cogr. Mathematica, vol. 3, pp. 645–656, 1998.
3. D. Applegate, R. Bixby, V. Chvatal, and W. Cook, “Chained Lin-Kernighan for large traveling salesman problems,” Informs Journal on Computing, (to appear).
4. R. Baralia, J.I. Hildago, and R. Perego, “A hybrid heuristic for the traveling salesman problem,” IEEE Transactions on Evolutionary Computation, vol. 5, no. 6, pp. 1–41, 2001.
5. J.L. Bentley, “Fast algorithms for geometric traveling salesman problems,” ORSA J. Computing, vol. 4, pp. 387–411, 1992.