Los puntos clave no están disponibles para este artículo en este momento.
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.
H. W. Lenstra (Tue,) studied this question.