1. Aarts, E.H.L., J.H.M. Korst, and P.J.M. van Laarhoven. (1997). “Simulated Annealing.” In E.H.L. Aarts and J.K. Lenstra (eds.), Local Search in Combinatorial Optimization Chichester: Wiley, pp. 91–136.
2. Aarts, E.H.L. and J.K. Lenstra. (eds.) (1997). Local Search in Combinatorial Optimization. Chichester: Wiley.
3. Aarts, E.H.L. and H.M.M. Ten Eikelder. (2002). “Simulated Annealing.” In P.M. Pardalos and M.G.C. Resende (eds.), Handbook of Applied Optimization. New York: Oxford University Press, pp. 209–220.
4. Aarts, E.H.L. and M.G.A. Verhoeven. (1997). “Genetic Local Search for the Traveling Salesman Problem.” In T. Bäck, D.B. Fogel, Z. Michalewicz (eds.), Handbook of Evoluationary Computation, G9.5, New York: Oxford University Press.
5. Ahuja, R.K., O. Ergun, J.B. Orlin, and A.P. Punnen. (2002). “A Survey of Very Large-Scale Neighborhood Search Techniques.” Discrete Applied Mathematics 123, 75–102.