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 Evolution Strategies, 2001.
DOI : 10.1007/978-3-662-04378-3

R. Cerf, An asymptotic theory for genetic algorithms, LNCS, vol.1063, 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

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

S. Goldfeld, R. Quandt, and H. Trotter, Maximization by Quadratic Hill-Climbing, Econometrica, vol.34, issue.3, p.541, 1966.
DOI : 10.2307/1909768

N. Hansen and A. Ostermeier, Completely Derandomized Self-Adaptation in Evolution Strategies, Evolutionary Computation, vol.9, issue.2, pp.159-195, 2001.
DOI : 10.1016/0004-3702(95)00124-7

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

I. Rechenberg, Evolutionstrategie: Optimierung Technisher 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, pp.63-66, 1994.
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.

C. Triadou, Méthodes de faisceau et de relaxation lagrangienne pour le traitement de grands problèmes d'optimisation combinatoire. soutenue en septembre, 2004.