1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.LG2019
Optimal Decision Trees for the Algorithm Selection Problem: Integer Programming Based Approaches
Matheus Guedes Vilas Boas, Haroldo Gambini Santos, Luiz Henrique de Campos Merschmann +1
Even though it is well known that for most relevant computational problems different algorithms may perform better on different classes of problem instances, most researchers still…
cs.DS2017★ 1 cited
MILP and Max-Clique based heuristics for the Eternity II puzzle
Fabio Salassa, Wim Vancroonenburg, Tony Wauters +2
The present paper considers a hybrid local search approach to the Eternity II puzzle and to unsigned, rectangular, edge matching puzzles in general. Both an original mixed-integer…