On performance estimates for two evolutionary algorithms

DOI10.1007/3-540-45365-2_17MaRDI QIDQ2770499zbMATH OpenFDO

Authors Anton Valentinovich Eremeev, Pavel Borisovsky

Publication date 13 February 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2037/20370161

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• On the analysis of the \((1+1)\) evolutionary algorithm
• On the analysis of a dynamic evolutionary algorithm
• On some theoretical properties of \((1+1)\) evolutionary algorithms
• Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem
• Some analyses about the time complexity of evolutionary algorithms

Cited in

(6)

• A comparative performance analysis of evolutionary algorithms on k-median and facility location problems
• On some variants of the merging variables based (1+1)-evolutionary algorithm with application to MaxSAT problem
• Two aspects of evolutionary algorithms
• Superpolynomial lower bounds for the \((1+1)\) EA on some easy combinatorial problems
• scientific article; zbMATH DE number 2079897 (Why is no real title available?)
• On some theoretical properties of \((1+1)\) evolutionary algorithms

This page was built for publication: On performance estimates for two evolutionary algorithms

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