Evolutionary computation in combinatorial optimization

MaRDI QIDQ3224103zbMATH OpenFDO

Authors Daniel Johannsen

Publication date 29 March 2012

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Evolutionary algorithms and matroid optimization problems
• Runtime analysis of evolutionary algorithms for the depth restricted (1,2)-minimum spanning tree problem
• Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem
• scientific article; zbMATH DE number 6019547
• Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem

Cited in

(19)

• Evolution algorithms in combinatorial optimization
• The analysis of evolutionary algorithms on sorting and shortest paths problems
• Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
• scientific article; zbMATH DE number 1728445 (Why is no real title available?)
• Evolutionary strategy of lexicographic order for combinational problem
• Superpolynomial lower bounds for the \((1+1)\) EA on some easy combinatorial problems
• Some fully polynomial time randomized approximation scheme based on an evolutionary algorithm
• On the analysis of the \((1+1)\) evolutionary algorithm for the maximum leaf spanning tree problem
• On the approximation ability of evolutionary optimization with application to minimum set cover
• scientific article; zbMATH DE number 1747649 (Why is no real title available?)
• scientific article; zbMATH DE number 2087973 (Why is no real title available?)
• scientific article; zbMATH DE number 2102024 (Why is no real title available?)
• Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem
• Runtime analysis of evolutionary algorithms for the depth restricted (1,2)-minimum spanning tree problem
• Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
• Evolutionary computation approaches to the curriculum sequencing problem
• Computing minimum cuts by randomized search heuristics
• Evolutionary algorithms and dynamic programming
• Evolutionary algorithms and matroid optimization problems

This page was built for publication: Evolutionary computation in combinatorial optimization

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