scientific article
From MaRDI portal
Publication:3224102
zbMath1235.90192MaRDI QIDQ3224102
Publication date: 29 March 2012
Full work available at URL: http://ebooks.worldscinet.com/ISBN/9789814282673/9789814282673_0002.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (7)
The impact of random initialization on the runtime of randomized search heuristics ⋮ 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 ⋮ On the analysis of trajectory-based search algorithms: when is it beneficial to reject improvements? ⋮ Markov chain analysis of evolutionary algorithms on OneMax function -- from coupon collector's problem to (1 + 1) EA ⋮ Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm ⋮ Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem
This page was built for publication:
