61 citations · 570 across the 108 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
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…
cs.NE2012★ 1 cited
A Fast and Effective Local Search Algorithm for Optimizing the Placement of Wind Turbines
Markus Wagner, Jareth Day, Frank Neumann
The placement of wind turbines on a given area of land such that the wind farm produces a maximum amount of energy is a challenging optimization problem. In this article, we tackle…
cs.NE2012
Computational Complexity Analysis of Multi-Objective Genetic Programming
Frank Neumann
The computational complexity analysis of genetic programming (GP) has been started recently by analyzing simple (1+1) GP algorithms for the problems ORDER and MAJORITY. In this pap…