arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2302.06049math.OC
收藏

一种求解0-1整数线性规划的多项式时间算法

A Polynomial Time Algorithm For 0-1 Integer Linear Programmings

G. Q. Zhang

AI总结:

本研究提出一种基于线性规划松弛与强割平面约束重构的0-1整数线性规划多项式时间算法,经复杂度分析验证其为多项式时间算法,意味着P=NP。

摘要:

本文提出了一种求解0-1整数线性规划的多项式时间算法。该方法延续了利用线性规划松弛求解整数线性规划(ILP)的经典思路,其创新点在于将线性规划中的每个约束都重构为强割平面。随后基于新约束构建了0-1整数线性规划的求解算法。算法复杂度分析表明,该算法是多项式时间算法,这意味着P=NP。

英文摘要:

A polynomial-time algorithm for 0-1 integer linear programmings has been proposed. This method continues the classic idea of solving ILP with its LP relaxation. The innovation is that every constraint in the LP is reconstructed into a strong cut. Then the solution algorithm of a 0-1 ILP is developed based on the new constraints. Algorithmic complexity analysis shows that the proposed algorithm is a polynomial-time algorithm, which means that P=NP.

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

↑