整数半定规划的 Chvátal-Gomory 过程及其在组合优化中的应用
The Chvátal-Gomory Procedure for Integer SDPs with Applications in Combinatorial Optimization
AI总结:
本文研究整数半定规划的 CG 割理论与分离方法,并将其用于 QTSP 的分支切割求解,显著提升了大规模实例的最优求解能力。
摘要:
本文研究整数半定规划(ISDP)这一类问题中著名的 Chvátal-Gomory(CG)过程。我们证明了关于通过迭代该过程得到的松弛层次的若干结果,还研究了谱面体初等闭包的不同表述。通过利用半定规划(SDP)的全对偶整数性,我们推导了一类特定谱面体初等闭包的多面体描述。此外,我们展示了如何在 ISDP 的分支切割框架中利用(加强的)CG 割。与文献中已有算法不同,我们方法中的分离例程同时利用半定约束和整数约束。我们为由组合优化问题产生的若干常见二元 SDP 类别提供了分离例程。在论文第二部分,我们将该方法全面应用于二次旅行商问题(QTSP)。基于有向 Hamilton 圈的代数连通性,引入了两个为 QTSP 建模的 ISDP。我们表明,由这些表述产生的 CG 割包含若干著名的割平面族。数值结果说明了 CG 割在我们的分支切割算法中的实际强度:该算法优于其他 ISDP 求解器,并能够将大型 QTSP 实例求解至最优。
英文摘要:
In this paper we study the well-known Chvátal-Gomory (CG) procedure for the class of integer semidefinite programs (ISDPs). We prove several results regarding the hierarchy of relaxations obtained by iterating this procedure. We also study different formulations of the elementary closure of spectrahedra. A polyhedral description of the elementary closure for a specific type of spectrahedra is derived by exploiting total dual integrality for SDPs. Moreover, we show how to exploit (strengthened) CG cuts in a branch-and-cut framework for ISDPs. Different from existing algorithms in the literature, the separation routine in our approach exploits both the semidefinite and the integrality constraints. We provide separation routines for several common classes of binary SDPs resulting from combinatorial optimization problems. In the second part of the paper we present a comprehensive application of our approach to the quadratic traveling salesman problem (QTSP). Based on the algebraic connectivity of the directed Hamiltonian cycle, two ISDPs that model the QTSP are introduced. We show that the CG cuts resulting from these formulations contain several well-known families of cutting planes. Numerical results illustrate the practical strength of the CG cuts in our branch-and-cut algorithm, which outperforms alternative ISDP solvers and is able to solve large QTSP instances to optimality.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。