A. Auger, Convergence results for the <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>??</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>-SA-ES using the theory of <mml:math altimg="si2.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>??</mml:mi></mml:math>-irreducible Markov chains, Theoretical Computer Science, vol.334, issue.1-3, pp.35-69, 2005.
DOI : 10.1016/j.tcs.2004.11.017

H. Beyer, The Theory of Evolutions Strategies, 2001.
DOI : 10.1007/978-3-662-04378-3

R. Cerf, An asymptotic theory for genetic algorithms, Artificial Evolution, pp.37-53, 1996.
DOI : 10.1007/3-540-61108-8_29

S. Droste, T. Jansen, and I. Wegener, On the analysis of the (1+1) evolutionary algorithm, Theoretical Computer Science, vol.276, issue.1-2, pp.51-81, 2002.
DOI : 10.1016/S0304-3975(01)00182-7

K. Fang and Y. Wang, Number-Theoretic Methods in Statistics, 1994.
DOI : 10.1007/978-1-4899-3095-8

O. François, An evolutionary strategy for global minimization and its Markov chain analysis, IEEE Transactions on Evolutionary Computation, vol.2, issue.3, pp.77-91, 1999.
DOI : 10.1109/4235.735430

B. Freisleben and P. Merz, New genetic local search operators for the TSP, PPSN96, LNCS 1141, pp.890-899, 1996.

J. Garnier, L. Kallel, and M. Schoenauer, Rigorous Hitting Times for Binary Mutations, Evolutionary Computation, vol.5, issue.3, pp.167-203, 1999.
DOI : 10.1162/evco.1996.4.2.195
URL : https://hal.archives-ouvertes.fr/inria-00001277

W. H. Hart, A Convergence Analysis of Unconstrained and Bound Constrained Evolutionary Pattern Search, Evolutionary Computation, vol.3, issue.4, pp.1-23, 2001.
DOI : 10.1137/S1052623493250780

M. Lozano, F. Herrera, N. Krasgonor, and D. Molina, Real-coded memetic algorithms with crossover hill-climbing [11] P. Merz and B. Freisleben. A genetic local search approach for the QAP, Proceedings of the 7 th International Conference on Genetic Algorithms, pp.465-470, 1997.
DOI : 10.1162/1063656041774983
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.199.530

P. Moscato, On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms, 1989.

H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods, Philadelphia: SIAM, 1992.
DOI : 10.1137/1.9781611970081

J. Poland, Explicit Local Models: Towards ???Optimal??? Optimization Algorithms, 2004.
DOI : 10.1007/978-3-540-30115-8_54
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.2476

I. Rechenberg, Evolutionstrategie: Optimierung Technischer Systeme nach Prinzipien des Biologischen Evolution, 1973.

G. Rudolph, Convergence analysis of canonical genetic algorithms, IEEE Transactions on Neural Networks, vol.5, issue.1, pp.96-101, 1994.
DOI : 10.1109/72.265964

G. Rudolph, Convergence of non-elitist strategies, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence
DOI : 10.1109/ICEC.1994.350041

G. Rudolph, How Mutation and Selection Solve Long-Path Problems in Polynomial Expected Time, Evolutionary Computation, vol.4, issue.2, pp.195-205, 1996.
DOI : 10.1162/evco.1996.4.2.195

G. Rudolph, Convergence rates of evolutionary algorithms for a class of convex objective functions, Control and Cybernetics, vol.26, issue.3, pp.375-390, 1997.

H. Schwefel, Numerical Optimization of Computer Models, 1981.