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

Mathematics of Operations Research publishes articles concerned with mathematical and computational foundations of operations research, including optimization, mathematical and dynamic programming, ...