Runtime analysis of competitive co-evolutionary algorithms for maximin optimisation of a bilinear function

DOI10.1007/S00453-024-01218-3MaRDI QIDQ6582376zbMATH OpenFDO

Authors Per Kristian Lehre

Publication date 2 August 2024

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00453-024-01218-3

zbMATH Keywords

co-evolutionary algorithmsevolutionary computationgame theoryruntime analysis

Mathematics Subject Classification ID

Graph theory (05Cxx) Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 960162 (Why is no real title available?)
• Runtime Analysis of a Co-Evolutionary Algorithm
• Runtime analysis of non-elitist populations: from classical optimisation to partial information
• Theory of evolutionary computation. Recent developments in discrete optimization
• Upper and lower bounds for randomized search heuristics in black-box optimization

Cited in

(1)

• A general upper bound for the runtime of a coevolutionary algorithm on impartial combinatorial games

This page was built for publication: Runtime analysis of competitive co-evolutionary algorithms for maximin optimisation of a bilinear function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582376)