17 citations · 44 across the 17 of their papers we have counts for
Showing 2013 · cs.NEShow all
3 papers · 2 filters
cs.NE2013★ 1 cited
Optimal Recombination in Genetic Algorithms
Anton V. Eremeev, Julia V. Kovalenko
This paper surveys results on complexity of the optimal recombination problem (ORP), which consists in finding the best possible offspring as a result of a recombination operator i…
cs.NE2013★ 6 cited
Non-Elitist Genetic Algorithm as a Local Search Method
Anton Eremeev
Sufficient conditions are found under which the iterated non-elitist genetic algorithm with tournament selection first visits a local optimum in polynomially bounded time on averag…
cs.NE2013★ 17 cited
Evolutionary Algorithms and Dynamic Programming
Benjamin Doerr, Anton Eremeev, Frank Neumann +2
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled…