1. E.H.L Aarts and J.H.M Korst. Simulated annealing and Boltzmann machines, Wiley, New York, 1988.
2. O. Catoni. Rough large deviation estimates for simulated annealing: Application to exponential schedules. Ann. Probab., 20 (1991), 3, 1109–1146.
3. R. Cerf. The dynamics of mutation-selection algorithms with large population sizes. Ann. Inst. H. Poincaré Probab. Statist., 32 (1996), 455–508.
4. T.E. Davis and J.C. Principe. A simulated annealing like convergence theory for the simple genetic algorithm. In R.K. Belew and L.B. Booker eds. Proceedings of the fourth Int. Conf. on Genetic Algorithms, San Mateo CA, Morgan Kauffman, 174–181, 1991.
5. O. François. An evolutionary strategy for global minimization and its Markov chain analysis, IEEE Transactions on Evolutionary Computation, 2, (1998), 77–90.