arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.00485math.OC
收藏

利用稀疏性求解最小k-划分问题

Exploiting sparsity for the min k-partition problem

Guanglei Wang, Hassan Hijazi

摘要:

最小k-划分问题是一个具有挑战性的组合问题,具有从电信到体育调度的各种应用。它推广了最大割问题,自六十年代后期以来得到了广泛的研究。在文献中提出的强整数公式遭受的有效不等式和整数变量的数量令人望而却步。在这项工作中,我们介绍了两个紧凑的整数线性和半定的重新制定,利用稀疏的基础图形和开发的基本结果,利用弦分解的力量。数值实验表明,新的公式提高了国家的最先进的。

英文摘要:

The minimum k-partition problem is a challenging combinatorial problem with a diverse set of applications ranging from telecommunications to sports scheduling. It generalizes the max-cut problem and has been extensively studied since the late sixties. Strong integer formulations proposed in the literature suffer from a prohibitive number of valid inequalities and integer variables. In this work, we introduce two compact integer linear and semidefinite reformulations that exploit the sparsity of the underlying graph and develop fundamental results leveraging the power of chordal decomposition. Numerical experiments show that the new formulations improve upon state-of-the-art.

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

↑