Probing features for automatic algorithm selection for pseudo-Boolean optimization

DOI10.1007/978-3-032-27242-3_30MaRDI QIDQ7356184zbMATH OpenFDO

Authors Amanda Salinas-Pinto, Catalina Pezo, Dorit S. Hochbaum, Bistra Dilkina, Ricardo Ñanculef, Roberto Asín Achá

Publication date 23 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-27242-3_30

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• Algorithm runtime prediction: methods \& evaluation
• ASlib: a benchmark library for algorithm selection
• Automatic algorithm selection for pseudo-Boolean optimization with given computational time limits
• Greedy function approximation: A gradient boosting machine.
• Handbook of satisfiability. In 2 parts
• scientific article; zbMATH DE number 5139161 (Why is no real title available?)
• P<scp>a</scp>PILO: A Parallel Presolving Library for Integer and Linear Optimization with Multiprecision Support
• Principles and Practice of Constraint Programming – CP 2004
• Random forests
• Revisiting satzilla features in 2024
• SATzilla: portfolio-based algorithm selection for SAT
• The algorithm selection competitions 2015 and 2017
• Towards objective measures of algorithm performance across instance space

This page was built for publication: Probing features for automatic algorithm selection for pseudo-Boolean optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7356184)