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. Journal Information ...

SIAM Journal on Applied Mathematics, Vol. 32, No. 1 (Jan., 1977), pp. 215-219 (5 pages) An analysis that progresses recursively along the terms of a linear equation generates a simple algebraic ...