This is a preview. Log in through your library . Mathematics of Operations Research publishes articles concerned with mathematical and computational foundations of operations research, including ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback