9 citations · 19 across the 13 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
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…
cs.AI2015
Averaged Hausdorff Approximations of Pareto Fronts based on Multiobjective Estimation of Distribution Algorithms
Luis Marti, Christian Grimme, Pascal Kerschke +2
In the a posteriori approach of multiobjective optimization the Pareto front is approximated by a finite set of solutions in the objective space. The quality of the approximation c…