arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0407041cs.DMcs.PL
收藏

约束规划中半定松弛的利用

Exploiting Semidefinite Relaxations in Constraint Programming

Willem Jan van Hoeve

摘要:

约束编程使用枚举和搜索树修剪来解决组合优化问题。为了加快这一解决方案的过程中,我们调查使用半定松弛约束规划。原则上,我们使用半定松弛的解来指导搜索树的遍历,使用有限差异搜索策略。此外,半定松弛产生解值的界,其用于修剪搜索树的部分。在稳定集和最大团问题上的实验结果表明,半定松弛确实可以大大提高约束规划的效率。

英文摘要:

Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of semidefinite relaxations within constraint programming. In principle, we use the solution of a semidefinite relaxation to guide the traversal of the search tree, using a limited discrepancy search strategy. Furthermore, a semidefinite relaxation produces a bound for the solution value, which is used to prune parts of the search tree. Experimental results on stable set and maximum clique problem instances show that constraint programming can indeed greatly benefit from semidefinite relaxations.

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

↑