Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics

DOI10.1007/978-3-642-33206-7_5zbMATH Open1328.68197OpenAlexW677840MaRDI QIDQ3459675FDOQ3459675

Thomas Jansen

Publication date: 11 January 2016

Published in: Theory and Principled Methods for the Design of Metaheuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33206-7_5

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Title not available (Why is that?)
• Complexity Theory
• Upper and lower bounds for randomized search heuristics in black-box optimization
• Combinatorial landscapes
• A no-free-lunch theorem for non-uniform distributions of target functions
• On the analysis of the \((1+1)\) evolutionary algorithm
• A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation

Cited In (2)

• Black-box Complexity of Parallel Search with Distributed Populations
• A framework for co-optimization algorithm performance and its application to worst-case optimization

This page was built for publication: Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics

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