利用格结构的精确分解分支法
Exact Decomposition Branching exploiting Lattice Structures
AI总结:
针对混合整数线性优化中严格不等式影响精确性的问题,本文利用约束矩阵的 $\Delta$-正则性所生成的格结构设计舍入规则,以增强 Decomposition Branching,并从理论和实验上证明其有限终止、精确且通常产生更小分支定界树。
摘要:
混合整数线性优化中的严格不等式可能会给保证收敛性和精确性带来困难。利用最优顶点解遵循格结构这一性质,我们提出了一种针对严格不等式的舍入规则,可保证精确性。所使用的格由属于连续变量的约束矩阵的 $\Delta$-正则性生成。我们将该舍入规则应用于 Yildiz 等人提出的 Decomposition Branching(分解分支法),该方法在其分支规则中使用严格不等式。我们证明,增强后的算法会在有限多步后终止,并给出精确解。为验证我们的方法,我们对两种易于检测 $\Delta$-正则性的不同模型进行了计算实验。结果证实了增强算法的精确性,并表明它通常会生成更小的分支定界树。
英文摘要:
Strict inequalities in mixed-integer linear optimization can cause difficulties in guaranteeing convergence and exactness. Utilizing that optimal vertex solutions follow a lattice structure we propose a rounding rule for strict inequalities that guaranties exactness. The lattice used is generated by $Δ$-regularity of the constraint matrix belonging to the continuous variables. We apply this rounding rule to Decomposition Branching by Yildiz et al., which uses strict inequalities in its branching rule. We prove that the enhanced algorithm terminates after finite many steps with an exact solution. To validate our approach, we conduct computational experiments for two different models for which $Δ$-regularity is easily detectable. The results confirm the exactness of our enhanced algorithm and demonstrate that it typically generates smaller branch-and-bound trees.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。