A Polynomial Time Algorithm For 0-1 Integer Linear Programmings
From MaRDI portal
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.
This page was built for publication: A Polynomial Time Algorithm For 0-1 Integer Linear Programmings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6426246)
