The SLO hierarchy of pseudo-Boolean functions and runtime of evolutionary algorithms

DOI10.1007/S00453-025-01359-ZMaRDI QIDQ6831299zbMATH OpenFDO

Authors Duc-Cuong Dang, Per Kristian Lehre

Publication date 7 April 2026

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-025-01359-Z

zbMATH Keywords

landscape analysismutation operatorsruntime analysis

Mathematics Subject Classification ID

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

Cites work

• A Greedy Heuristic for the Set-Covering Problem
• Analyzing evolutionary algorithms. The computer science perspective.
• Cooling Schedules for Optimal Annealing
• Efficient optimisation of noisy fitness functions with population-based evolutionary algorithms
• scientific article; zbMATH DE number 5852793 (Why is no real title available?)
• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• New upper and lower bounds for randomized and quantum local search
• On the complexity of the parity argument and other inefficient proofs of existence
• Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions.
• Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
• Probability with Martingales
• Runtime analysis of non-elitist populations: from classical optimisation to partial information
• Statistical analysis of local search landscapes
• Upper and lower bounds for randomized search heuristics in black-box optimization

This page was built for publication: The SLO hierarchy of pseudo-Boolean functions and runtime of evolutionary algorithms

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