1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.AI2016
COCO: The Experimental Procedure
Nikolaus Hansen, Tea Tusar, Olaf Mersmann +2
We present a budget-free experimental setup and procedure for benchmarking numericaloptimization algorithms in a black-box scenario. This procedure can be applied with the COCO ben…
cs.DS2012★ 1 cited
A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem
Olaf Mersmann, Bernd Bischl, Heike Trautmann +2
Meta-heuristics are frequently used to tackle NP-hard combinatorial optimization problems. With this paper we contribute to the understanding of the success of 2-opt based local se…