scientific article; zbMATH DE number 6019547

MaRDI QIDQ3224102zbMATH OpenFDO

Authors Peter S. Oliveto, Xin Yao

Publication date 29 March 2012

Full work available at URL http://ebooks.worldscinet.com/ISBN/9789814282673/9789814282673_0002.html

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A runtime analysis of parallel evolutionary algorithms in dynamic optimization
• Runtime analysis of evolutionary algorithms via symmetry arguments
• Foundations of Genetic Algorithms
• Towards an analytic framework for analysing the computation time of evolutionary algorithms
• Analysis for time complexity of evolutionary algorithms
• Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
• Some analyses about the time complexity of evolutionary algorithms

Cited in

(23)

• Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
• On the analysis of trajectory-based search algorithms: when is it beneficial to reject improvements?
• Optimal static and self-adjusting parameter choices for the (1+( , )) genetic algorithm
• Markov chain analysis of evolutionary algorithms on OneMax function -- from coupon collector's problem to (1 + 1) EA
• Fixed-target runtime analysis
• When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms
• On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms
• The runtime of the compact genetic algorithm on jump functions
• On the runtime analysis of the simple genetic algorithm
• Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem
• Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
• Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
• scientific article; zbMATH DE number 1696516 (Why is no real title available?)
• The impact of random initialization on the runtime of randomized search heuristics
• Evolutionary computation in combinatorial optimization
• Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
• Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem
• Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem
• Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering
• Analysis for time complexity of evolutionary algorithms
• Foundations of Genetic Algorithms
• Runtime analysis of evolutionary neural architecture search for binary classification
• The effect of multiple optima on the simple GA run-time complexity

This page was built for publication:

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