On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions

Ackley, 1987 Droste, 1998, A rigorous complexity analysis of the (1+1) evolutionary algorithm for linear functions with boolean inputs, 499 Droste, 2000, A natural and simple function which is hard for all evolutionary algorithms, 2704 Droste, 2002, On the analysis of the (1+1) evolutionary algorithm, Theoret. Comput. Sci., 276, 51, 10.1016/S0304-3975(01)00182-7 Durand, 1998, Genetic crossover for partially separable functions, 487 Fogel, 1995 Garnier, 1999, Rigorous hitting times for binary mutations, Evolutionary Computation, 7, 173, 10.1162/evco.1999.7.2.173 Goldberg, 1989 Holland, 1975 Horn, 1994, Long path problems, vol. 866, 149 Jansen, 1999, On the analysis of evolutionary algorithms—a proof that crossover really can help, vol. 1643, 184 Jansen, 2001, Real royal road functions—functions where crossover provably is essential, 375 Koza, 1992 Motwani, 1995 Mühlenbein, 1992, How genetic algorithms really work I. Mutation and hillclimbing, 15 Rosenberg, 1975, Reduction of bivalent maximization to the quadratic case, Cahiers du Centre d'Etudes de Recherche Operationnelle, 17, 71 Rudolph, 1997, How mutation and selection solve long-path problems in polynomial expected time, Evolutionary Computation, 4, 195, 10.1162/evco.1996.4.2.195 Schwefel, 1995 Whitley, 1996, Evaluating evolutionary algorithms, Artificial Intelligence, 85, 245, 10.1016/0004-3702(95)00124-7