Optimal decision trees for the algorithm selection problem: integer programming based approaches

DOI10.1111/itor.12724arXiv1907.02211WikidataQ127205316 ScholiaQ127205316MaRDI QIDQ6092614

Matheus Guedes Vilas Boas, Greet vanden Berghe, Haroldo Gambini Santos, Luiz Henrique de Campos Merschmann

Publication date: 23 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.02211

zbMATH Keywords

integer programmingdata miningvariable neighborhood searchdecision treesalgorithm selection problemCOIN-OR branch-and-cutfeature-based parameter tuning

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Integer programming techniques for the nurse rostering problem
• Algorithm runtime prediction: methods \& evaluation
• \textsc{Alors}: an algorithm recommender system
• Integer-programming software systems
• Progress in presolving for mixed integer programming
• A hybrid heuristic algorithm for the open-pit-mining operational planning problem
• Constructing optimal binary decision trees is NP-complete
• Variable neighborhood search
• Drawing graphs with mathematical programming and variable neighborhood search
• Integer programming techniques for educational timetabling
• Feature-based tuning of single-stage simulated annealing for examination timetabling
• Optimization by GRASP
• ParamILS: An Automatic Algorithm Configuration Framework
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
• An analysis of parameter adaptation in reactive tabu search
• Production Planning by Mixed Integer Programming
• Optimal classification trees

This page was built for publication: Optimal decision trees for the algorithm selection problem: integer programming based approaches