Upper Bounds on the Running Time of the Univariate Marginal Distribution Algorithm on OneMax

Stochastic Runtime Analysis of the Cross-Entropy Algorithm

(2017) Zijun Wu et al.   IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION

Improved time complexity analysis of the Simple Genetic Algorithm

(2015) Pietro S. Oliveto et al.   THEORETICAL COMPUTER SCIENCE

Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions

(2013) CARSTEN WITT   COMBINATORICS PROBABILITY & COMPUTING

The choice of the offspring population size in the (1,λ) evolutionary algorithm

(2013) Jonathan E. Rowe et al.   THEORETICAL COMPUTER SCIENCE

A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms

(2012) Dirk Sudholt   IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION

An introduction and survey of estimation of distribution algorithms

(2011) Mark Hauschild et al.   Swarm and Evolutionary Computation

Analysis of Computational Time of Simple Estimation of Distribution Algorithms

(2010) Tianshi Chen et al.   IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION