整数规划中多项式对称打破约束的自动生成
Automatic Generation of Polynomial Symmetry Breaking Constraints
AI总结:
本文提出了一种基于多项式不等式的自动对称打破方法,通过生成随机二次约束减少整数规划计算时间。
摘要:
对称性在整数规划中会导致冗余搜索,通常通过对称打破约束来消除尽可能多的等价解。我们提出了一种代数方法,可以生成一个随机多项式不等式族,可用于对称打破。该方法需要任意基多项式和特定于整数规划问题的置换群作为输入。计算可以在任何主要的符号计算软件中轻松完成。为了测试我们的方法,我们描述了一个关于接近半容量0-1装箱问题的案例研究,该问题表现出显著的对称性。我们静态生成随机二次打破器,并将其添加到基线整数规划问题中,然后使用Gurobi求解。结果表明,简单的对称打破器,尤其是结合少量变量和置换,最一致地减少了计算时间。
英文摘要:
Symmetry in integer programming causes redundant search and is often handled with symmetry breaking constraints that remove as many equivalent solutions as possible. We propose an algebraic method which allows to generate a random family of polynomial inequalities which can be used as symmetry breakers. The method requires as input an arbitrary base polynomial and a group of permutations which is specific to the integer program. The computations can be easily carried out in any major symbolic computation software. In order to test our approach, we describe a case study on near half-capacity 0-1 bin packing instances which exhibit substantial symmetries. We statically generate random quadratic breakers and add them to a baseline integer programming problem which we then solve with Gurobi. It turns out that simple symmetry breakers, especially combining few variables and permutations, most consistently reduce work time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。