Ask a Question

Prefer a chat interface with context about you and your work?

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

We consider integer programming problems in standard form max { c T x : Ax = b , x ⩾ 0, x ∈ Z n } where A ∈ Z m × n , b ∈ Z m , and c ∈ Z n . We show that such an …