14 citations · 35 across the 8 of their papers we have counts for
1 paper · 1 filter
Konstantin Klemm, Anita Mehta, Peter F. Stadler
Difficult, in particular NP-complete, optimization problems are traditionally solved approximately using search heuristics. These are usually slowed down by the rugged landscapes e…