Runtime analysis with variable cost

DOI10.1007/S00453-025-01307-XMaRDI QIDQ6936590zbMATH OpenFDO

Authors Per Kristian Lehre, Andrew M. Sutton

Publication date 29 August 2025

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

evolutionary algorithmsruntime analysiscost functions

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50)

Cites work

• Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering
• Analyzing randomized search heuristics via stochastic domination
• Computational intelligence in expensive optimization problems
• Fitness levels with tail bounds for the analysis of randomized search heuristics
• Fixed Budget Performance of the (1+1) EA on Linear Functions
• Improved time complexity analysis of the simple genetic algorithm
• Knowledge incorporation in evolutionary computation
• Non-uniform mutation rates for problems with unknown solution lengths
• On Cumulative Sums of Random Variables
• Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
• Solving problems with unknown solution length at almost no extra cost
• Some Generalizations of the Theory of Cumulative Sums of Random Variables
• The linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates
• Tight bounds on the optimization time of a randomized search heuristic on linear functions
• Understanding Simple Asynchronous Evolutionary Algorithms

This page was built for publication: Runtime analysis with variable cost

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