Publication | Closed Access
Integer Programming with a Fixed Number of Variables
1.4K
Citations
8
References
1983
Year
Mathematical ProgrammingFixed NumberEngineeringInteger OptimizationMixed Integer OptimizationComputational ComplexityDiscrete MathematicsLinear ProgrammingCombinatorial OptimizationDiscrete OptimizationInteger ProgrammingQuadratic ProgrammingOperations Research
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.
| Year | Citations | |
|---|---|---|
Page 1
Page 1