ILP in poly-time?

219 Views Asked by At

Integer programming is said to be NP-complete. However, I think formulating a problem into ILP can't prove the problem to be NP-hard. Is there any example of problem that can be modeled into ILP but has a polynomial time?

0

There are 0 best solutions below