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.

A dynamic programming approach is proposed to select optimally among a given set of products and allocate integer shelf-space units to the selected products in supermarkets. The approach is designed ...