The paper proposes a polynomial algorithm for solving systems of linear inequalities. The algorithm uses a polynomial relaxation-type procedure which either finds a solution for Ax = b, 0 <= x <= 1, or decides that the system has no integer solutions.
Article
View A polynomial relaxation-type algorithm for linear programming