Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Friedrich Eisenbrand, Robert Weismantel

We consider integer programming problems in standard form $\max \{c^{T}x:Ax=b,x\ge 0,x\in Z^n\}$ where $A\in Z^{m\times n}$, $b\in Z^m$ and $c\in Z^n$. We show that…