R. C. Daniel, Martyn Jeffreys, Unboundedness in Integer and Discrete Programming L.P. Relaxations, The Journal of the Operational Research Society, Vol. 30, No. 12 ...

It is shown that the integer linear programming problem with a fixed number of variables is polynomially solvable. The proof depends on methods from geometry of numbers.