1 citations · 1 across the 3 of their papers we have counts for
4 papers
AC-Band: A Combinatorial Bandit-Based Approach to Algorithm Configuration
Jasmin Brandt, Elias Schede, Viktor Bengs +3
We study the algorithm configuration (AC) problem, in which one seeks to find an optimal parameter configuration of a given target algorithm in an automated way. Recently, there ha…
The First AI4TSP Competition: Learning to Solve Stochastic Routing Problems
Laurens Bliek, Paulo da Costa, Reza Refaei Afshar +19
This paper reports on the first international competition on AI for the traveling salesman problem (TSP) at the International Joint Conference on Artificial Intelligence 2021 (IJCA…
Learning How to Optimize Black-Box Functions With Extreme Limits on the Number of Function Evaluations
Carlos Ansotegui, Meinolf Sellmann, Tapan Shah +1
We consider black-box optimization in which only an extremely limited number of function evaluations, on the order of around 100, are affordable and the function evaluations must b…
Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problem
André Hottung, Kevin Tierney
Learning how to automatically solve optimization problems has the potential to provide the next big leap in optimization technology. The performance of automatically learned heuris…