Integer Programming with a Fixed Number of Variables
@article{Lenstra1983IntegerPW, title={Integer Programming with a Fixed Number of Variables}, author={H. Lenstra}, journal={Math. Oper. Res.}, year={1983}, volume={8}, pages={538-548} }
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.
Topics from this paper
Paper Mentions
1,310 Citations
Integer quadratic programming in the plane
- Mathematics, Computer Science
- SODA
- 2014
- 17
- Highly Influenced
- PDF
A linear algorithm for integer programming in the plane
- Mathematics, Computer Science
- Math. Program.
- 2005
- 21
- PDF
FPTAS for mixed-integer polynomial optimization with a fixed number of variables
- Mathematics, Computer Science
- SODA '06
- 2006
- 10
- PDF
Integer programming with 2-variable equations and 1-variable inequalities
- Mathematics, Computer Science
- Inf. Process. Lett.
- 2009
- 6
- PDF
Polyhedral Approaches to Mixed Integer Linear Programming
- Mathematics, Computer Science
- 50 Years of Integer Programming
- 2010
- 43
- PDF
The LLL Algorithm and Integer Programming
- Mathematics, Computer Science
- The LLL Algorithm
- 2010
- 5
- Highly Influenced
References
SHOWING 1-10 OF 23 REFERENCES
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
- Mathematics, Computer Science
- JACM
- 1976
- 61
- PDF
Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Mathematics, Computer Science
- SIAM J. Comput.
- 1979
- 408
- PDF
A Polynomial Algorithm for the Two-Variable Integer Programming Problem
- Mathematics, Computer Science
- JACM
- 1980
- 61
- Highly Influential
- PDF
The ellipsoid method and its consequences in combinatorial optimization
- Mathematics, Computer Science
- Comb.
- 1981
- 1,928
- Highly Influential
A bound on solutions of linear integer equalities and inequalities
- Mathematics
- 1978
- 120
- Highly Influential
- PDF
Computers and Intractability: A Guide to the Theory of NP-Completeness
- Computer Science, Mathematics
- 1978
- 47,277
- PDF