A Polynomial Time Algorithm For 0-1 Integer Linear Programmings
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.