1. Albert LA (2001) Efficient genetic algorithms using discretization scheduling. Master’s thesis, University of Illinois at Urbana-Champaign (also IlliGAL report no 2002005)
2. Asoh H, Mühlenbein H (1994) On the mean convergence time of evolutionary algorithms without selection and mutation. PPSN 3, pp 98–107
3. Bäck T (1994) Selective pressure in evolutionary algorithms: a characterization of selection mechanisms. In: Proceedings of the 1st IEEE conference on evolutionary computation, Orlando, pp 57–62
4. Bäck T (1995) Generalized convergence models for tournament—and (μ, λ)—selection. In: Proceedings of 6th international conference on genetic algorithms, Pittsburgh, pp 2–8
5. Bäck T (1996) Evolutionary algorithms in theory and practice. Oxford University Press, New York