7 citations · 10 across the 12 of their papers we have counts for
3 papers · 1 filter
When to be Discrete: Analyzing Algorithm Performance on Discretized Continuous Problems
André Thomaser, Jacob de Nobel, Diederick Vermetten +3
The domain of an optimization problem is seen as one of its most important characteristics. In particular, the distinction between continuous and discrete optimization is rather im…
Towards Self-adaptive Mutation in Evolutionary Multi-Objective Algorithms
Furong Ye, Frank Neumann, Jacob de Nobel +2
Parameter control has succeeded in accelerating the convergence process of evolutionary algorithms. While empirical and theoretical studies have shed light on the behavior of algor…
Benchmarking Algorithms for Submodular Optimization Problems Using IOHProfiler
Frank Neumann, Aneta Neumann, Chao Qian +7
Submodular functions play a key role in the area of optimization as they allow to model many real-world problems that face diminishing returns. Evolutionary algorithms have been sh…