arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2111.04858cs.DMmath.CO
收藏

二元多项式优化的简单奇$β$-圈不等式

Simple odd $β$-cycle inequalities for binary polynomial optimization

Alberto Del Pia, Matthias Walter

AI总结:

本文针对二元多项式优化中的多线性多面体,提出简单奇$β$-圈不等式,并给出适用于任意实例的强多项式时间分离算法,同时保持Chvátal秩2且足以描述圈超图多面体,实验显示其有助于缩小完整性间隙但计算成本较高。

摘要:

我们研究在二元多项式优化中自然出现的多线性多面体。Del Pia和Di Gregorio引入了对该多面体有效的奇$β$-圈不等式类,证明了这些不等式相对于标准松弛通常具有Chvátal秩2,并且与花不等式一起,它们为圈超图实例提供了完美公式化。此外,他们描述了当实例为圈超图时的分离算法。我们引入一个更弱的版本,称为简单奇$β$-圈不等式,并为其建立了适用于任意实例的强多项式时间分离算法。这些不等式在一般情况下仍具有Chvátal秩2,并且仍足以描述圈超图的多线性多面体。最后,我们报告了原型实现的计算结果。在实验中,简单奇$β$-圈不等式有时有助于缩小更多的完整性间隙;然而,初步实现具有较高的计算成本,表明分离算法仍有改进空间。

英文摘要:

We consider the multilinear polytope which arises naturally in binary polynomial optimization. Del Pia and Di Gregorio introduced the class of odd $β$-cycle inequalities valid for this polytope, showed that these generally have Chv{á}tal rank 2 with respect to the standard relaxation and that, together with flower inequalities, they yield a perfect formulation for cycle hypergraph instances. Moreover, they describe a separation algorithm in case the instance is a cycle hypergraph. We introduce a weaker version, called simple odd $β$-cycle inequalities, for which we establish a strongly polynomial-time separation algorithm for arbitrary instances. These inequalities still have Chv{á}tal rank 2 in general and still suffice to describe the multilinear polytope for cycle hypergraphs. Finally, we report about computational results of our prototype implementation. The simple odd $β$-cycle inequalities sometimes help to close more of the integrality gap in the experiments; however, the preliminary implementation has substantial computational cost, suggesting room for improvement in the separation algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑