https://doi.org/10.2307/3009435 • https://www.jstor.org/stable/3009435 Copy URL Commercial branch and bound codes for solving the general mixed integer linear ...

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