# Is Binary Integer Linear Programming solvable in polynomial time?

The paper Solving the Binary Linear Programming Model in Polynomial Time claims that Binary Integer Linear Programming is in P. However, it seems that no subsequent literature in the mainstream has done any further study on this. I am a bit doubtful regarding the correctness of the claim made in that paper. Therefore, I have put this question here.

You can also find the claim that BIP $$\in$$ NPC in many class notes, e.g., this set.