17 citations · 17 across the 1 of their papers we have counts for
2 papers
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…
cs.NE2012
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
Benjamin Doerr, Daniel Johannsen, Timo Kötzing +2
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit…