1. Aarts, E. H. L., Korst, J. H. M., & Laarhoven, P. J. M. (1988). A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem. Journal of Statistical Physics, 50, 189–206.
2. Applegate, D., Bixby, R. E., Chvátal, V., & Cook, W. (1995). Finding cuts in the TSP(A preliminary report) DIMACS (Technical Report 95–05). New Brunswick, USA: Rutgers University.
3. Applegate, D., Bixby, R. E., Chvátal, V., & Cook, W. (2006). The traveling salesman problem: A computational study. Princeton: Princeton University Press.
4. Arora, S. (2002). Approximation algorithms for geometric TSP. In G. Gutin & A. P. Punnen (Eds.), The traveling salesman problem and its variations (pp. 207–222). Dordrecht, The Netherlands: Kluwer.
5. Balas, E. (2002). The prize collecting traveling salesman problem and its applications. In G. Gutin & A. P. Punnen (Eds.), The traveling salesman problem and its variations (pp. 663–696). Dordrecht, The Netherlands: Kluwer.