activity
20152026
most citedAutomated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learning

174 citations · 389 across the 26 of their papers we have counts for

collaborators
Showing 2020 · cs.AIShow all

1 paper · 2 filters

cs.AI2020

Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection

Jakob Bossek, Pascal Kerschke, Heike Trautmann

The Traveling-Salesperson-Problem (TSP) is arguably one of the best-known NP-hard combinatorial optimization problems. The two sophisticated heuristic solvers LKH and EAX and respe…