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

DOI10.1016/j.jda.2004.02.001zbMath1066.90143OpenAlexW1996375957WikidataQ57200673 ScholiaQ57200673MaRDI QIDQ1775016

Ingo Wegener, Carsten Witt

Publication date: 4 May 2005

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2004.02.001

zbMATH Keywords

Boolean functionsEvolutionary algorithmsComplexity analysisQuadratic functions(1+1) EAEvolution strategies

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (9)

Towards implementation of a generalized architecture for high-level quantum programming language ⋮ The use of tail inequalities on the probable computational time of randomized search heuristics ⋮ On the analysis of a dynamic evolutionary algorithm ⋮ Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions ⋮ The time complexity analysis of a class of gene expression programming ⋮ First steps to the runtime complexity analysis of ant colony optimization ⋮ Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem ⋮ Runtime analysis of ant colony optimization with best-so-far reinforcement ⋮ How to analyse evolutionary algorithms.

Cites Work

• On the analysis of the \((1+1)\) evolutionary algorithm
• Real royal road functions -- where crossover provably is essential
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions