通过伪布尔推理改进MIP求解器中的冲突分析
Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning
AI总结:
本研究将伪布尔推理引入MIP求解器的冲突分析,提出基于混合整数舍入割的新算法,在0-1整数线性规划实例上优于现有方法,开辟了有前景的研究方向。
摘要:
冲突分析已成功从布尔可满足性(SAT)求解推广到混合整数规划(MIP)求解器,但尽管MIP求解器处理一般线性不等式,MIP中的冲突分析仍局限于使用更受限的子句约束进行推理。这与所谓的伪布尔求解中执行冲突分析的方式形成对比,在伪布尔求解中,求解器可以直接使用0-1整数线性不等式进行推理,而不是使用从这些不等式提取的子句约束。在本工作中,我们研究了如何将伪布尔冲突分析集成到MIP求解中,重点关注0-1整数线性规划(0-1 ILPs)。用MIP术语表述,冲突分析可以理解为一系列线性组合和割的序列。我们利用这一视角设计了一种基于混合整数舍入(MIR)割的新冲突分析算法,该算法在理论上优于伪布尔求解中最先进基于除法的现有方法。我们还报告了在开源MIP求解器SCIP中首次实现不同伪布尔冲突分析方法的概念验证结果。当在来自MIPLIB 2017的大量且多样化的0-1 ILP实例集上进行评估时,我们新的基于MIR的冲突分析优于先前的伪布尔方法和MIP中使用的基于子句的方法。我们的结论是,MIP中的伪布尔冲突分析是一个值得进一步研究的有前景的研究方向,并且研究使用这种冲突分析在约束编程中生成更强的no-goods可能也是有意义的。
英文摘要:
Conflict analysis has been successfully generalized from Boolean satisfiability (SAT) solving to mixed integer programming (MIP) solvers, but although MIP solvers operate with general linear inequalities, the conflict analysis in MIP has been limited to reasoning with the more restricted class of clausal constraint. This is in contrast to how conflict analysis is performed in so-called pseudo-Boolean solving, where solvers can reason directly with 0-1 integer linear inequalities rather than with clausal constraints extracted from such inequalities. In this work, we investigate how pseudo-Boolean conflict analysis can be integrated in MIP solving, focusing on 0-1 integer linear programs (0-1 ILPs). Phrased in MIP terminology, conflict analysis can be understood as a sequence of linear combinations and cuts. We leverage this perspective to design a new conflict analysis algorithm based on mixed integer rounding (MIR) cuts, which theoretically dominates the state-of-the-art division-based method in pseudo-Boolean solving. We also report results from a first proof-of-concept implementation of different pseudo-Boolean conflict analysis methods in the open-source MIP solver SCIP. When evaluated on a large and diverse set of 0-1 ILP instances from MIPLIB 2017, our new MIR-based conflict analysis outperforms both previous pseudo-Boolean methods and the clause-based method used in MIP. Our conclusion is that pseudo-Boolean conflict analysis in MIP is a promising research direction that merits further study, and that it might also make sense to investigate the use of such conflict analysis to generate stronger no-goods in constraint programming.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。