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

DOI10.1007/S00453-024-01218-3MaRDI QIDQ6582376FDOQ6582376

Authors: Per Kristian Lehre 

Publication date: 2 August 2024

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

game theoryevolutionary computationruntime analysisco-evolutionary algorithms

Mathematics Subject Classification ID

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

Cites Work

• Upper and lower bounds for randomized search heuristics in black-box optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Runtime analysis of non-elitist populations: from classical optimisation to partial information
• Theory of evolutionary computation. Recent developments in discrete optimization
• Runtime Analysis of a Co-Evolutionary Algorithm

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)