Eisenbrand, FriedrichLaue, Sören2008-05-132008-05-132008-05-13200510.1007/s10107-004-0520-0https://infoscience.epfl.ch/handle/20.500.14299/23718We show that a 2-variable integer program, defined by m constraints involving coefficients with at most φ bits, can be solved with O(m+φ) arithmetic operations on rational numbers of size O(φ). © Springer-Verlag 2004.A linear algorithm for integer programming in the planetext::journal::journal article::research article