Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
H. W. Lenstra (1983) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: