arrow
返回

Automatic algorithm selection for Pseudo-Boolean optimization with given computational time limits

delete2025-01-01
delete0
PRE
AI
C
Catalina Pezo
D
Dorit S. Hochbaum
J
Julio Godoy
R
Roberto Asín‐Achá *
DOI:10.1016/j.cor.2024.106836delete
delete原文链接
delete分享
delete收藏
摘要

摘要

En 中文
Machine learning (ML) techniques have been proposed to automatically select the best solver from a portfolio of solvers. They have been applied to various problems including Boolean Satisfiability, Traveling Salesperson and Graph Coloring. These techniques are used to implement meta-solvers that receive, as input, the instance of a problem, predict the best-performing solver in the portfolio, and execute it to deliver a solution. Typically, the quality of the solution improves with a longer computational time. This has led to the development of anytime meta-solvers, , which consider both the instance and a user-prescribed computational time limit. Anytime meta-solvers predict the best-performing solver within the specified time limit. In this study, we focus on designing anytime meta-solvers for the NP-hard optimization problem of Pseudo-Boolean Optimization (PBO), which generalizes Satisfiability and Maximum Satisfiability problems. The effectiveness of our approach is demonstrated via extensive empirical study in which our anytime meta-solver, named PBO_MS, improves dramatically on the performance of Mixed Integer Programming solver Gurobi, which is the best-performing single solver in the portfolio. We generalize the anytime meta-solver by predicting a given number p >= 1 of best solvers in the portfolio and then run these, each with equal share of the specified time limit. This anytime p-meta-solver is shown here to outperform both the anytime 1-meta-solver as well as a fixed selection of p solvers by a wide margin.
Keyword:
Algorithm selection
PBO
Combinatorial optimization
ML

期刊

C
Computers and Operations Research
IF:
4.3
论文数:
6.5K
被引数:
1.8W

机构

U
University of California Berkeley
学者数:
3.5W
论文数: 2.8W
被引数: 11.3W
University of California System 封面图
University of California System
学者数:
37.7W
论文数: 33.8W
被引数: 6.6K
U
universidad de concepcion
学者数:
8.4K
论文数: 6.4K
被引数: 8
学者 查看更多机构
引用论文

引用论文

Capping methods for the automatic configuration of optimization algorithms
err2022-03-01
err6
errOAAI
errde Souza, Marcelo; Ritt, Marcus; Lopez-Ibanez, Manuel
err分享
err收藏
Bagging predictorsBagging预测器
err1996-08-01
err1.0W
PREAI
errBreiman, L
err分享
err收藏
err分享
err收藏
Towards objective measures of algorithm performance across instance space
err2014-05-01
err141
errOAAI
errSmith-Miles, Kate; Baatar, Davaatseren; Wreford, Brendan; Lewis, Rhyd
err分享
err收藏
Gold nanoparticles containing redox-active supramolecular dendrons that recognize H2PO4–
err2001-01-01
err0
PREAI
errMarie-Christine Daniel; Jaime Ruiz; Sylvain Nlate; Jennifer Palumbo; Didier Astruc; Jean-Claude Blais
err分享
err收藏
An economics approach to hard computational problems
errSCIENCE
IF45.8
err1997-01-03
err201
PREAI
errHuberman, BA; Lukose, RM; Hogg, T
err分享
err收藏
Properties ofP30Levels from the ReactionSi29(p, γ)P30. II
err1969-11-20
err0
PREAI
errGale I. Harris; A. K. Hyder; J. Walinga
err分享
err收藏
学者 查看更多内容