Integer Programming with a Fixed Number of Variables 论文
1983Mathematics of Operations Research引用 1438
Optimization and Packing ProblemsComplexity and Algorithms in GraphsVehicle Routing Optimization Methods
摘要
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.