1 code implementation • 29 Jun 2020 • Moritz Seiler, Janina Pohl, Jakob Bossek, Pascal Kerschke, Heike Trautmann
In this work we focus on the well-known Euclidean Traveling Salesperson Problem (TSP) and two highly competitive inexact heuristic TSP solvers, EAX and LKH, in the context of per-instance algorithm selection (AS).