使用 SCIP 求解伪布尔问题的最先进方法
State-of-the-art Methods for Pseudo-Boolean Solving with SCIP
AI总结：
本文总结 SCIP 在 2024 年伪布尔竞赛中的优胜表现与求解数据，并介绍进一步增强其伪布尔求解能力的获奖算法思想。
摘要：
伪布尔问题处理的是布尔变量上具有整数系数的线性或多项式约束。其目标在于优化一个线性目标函数，或寻找一个可行解，或寻找一个尽可能满足更多约束的解。在 2024 年伪布尔竞赛中，融入 SCIP 框架的求解器在其参赛的六个类别中的五个类别获胜。在总共 1,207 个实例中，SCIP 成功求解了 759 个，而其并行版本 FiberSCIP 求解了 776 个。基于竞赛结果，我们进一步增强了 SCIP 的伪布尔能力。本文讨论了这些结果，并介绍了获胜的算法思想。
英文摘要：
The Pseudo-Boolean problem deals with linear or polynomial constraints with integer coefficients over Boolean variables. The objective lies in optimizing a linear objective function, or finding a feasible solution, or finding a solution that satisfies as many constraints as possible. In the 2024 Pseudo-Boolean competition, solvers incorporating the SCIP framework won five out of six categories it was competing in. From a total of 1,207 instances, SCIP successfully solved 759, while its parallel version FiberSCIP solved 776. Based on the results from the competition, we further enhanced SCIP's Pseudo-Boolean capabilities. This article discusses the results and presents the winning algorithmic ideas.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
