Totally $\Delta$-modular IPs with two non-zeros in most rows

Stefan Kober

Integer programs (IPs) on constraint matrices with bounded subdeterminants are conjectured to be solvable in polynomial time. We give a strongly polynomial time algorithm to solve…