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}
}
  • H. Lenstra
  • Published 1983
  • Mathematics, Computer Science
  • Math. Oper. Res.
    • 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. 
    View PDF
    1,310 Citations
    Highly Influencial Citations
    99
    Background Citations
    321
    Methods Citations
    283
    Results Citations
    14

    Topics from this paper

    Explore Further: Topics Discussed in This Paper

    1,310 Citations
    Citation Type

    Citation Type

    Integer quadratic programming in the plane
    • 17
    • Highly Influenced
    • PDF
    A linear algorithm for integer programming in the plane
    • 21
    • PDF
    An integral transformation for integer programming problems
    • 1
    FPTAS for mixed-integer polynomial optimization with a fixed number of variables
    • 10
    • PDF
    On Reduction Algorithms in Non Linear Integer Mathematical Programming
    • 6
    A Faster Algorithm for Two-Variable Integer Programming
    • 2
    • PDF
    On the number of vertices in integer linear programming problems
    • 11
    • PDF
    Integer programming with 2-variable equations and 1-variable inequalities
    • 6
    • PDF
    Polyhedral Approaches to Mixed Integer Linear Programming
    • 43
    • PDF
    The LLL Algorithm and Integer Programming
    • 5
    • Highly Influenced

    References

    SHOWING 1-10 OF 23 REFERENCES
    A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
    • 61
    • PDF
    Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
    • 408
    • PDF
    A Polynomial Algorithm for the Two-Variable Integer Programming Problem
    • R. Kannan
    • Mathematics, Computer Science
    • JACM
    • 1980
    • 61
    • Highly Influential
    • PDF
    The ellipsoid method and its consequences in combinatorial optimization
    • 1,928
    • Highly Influential
    A bound on solutions of linear integer equalities and inequalities
    • 120
    • Highly Influential
    • PDF
    Factoring polynomials with rational coefficients
    • 3,726
    • PDF
    Computers and Intractability: A Guide to the Theory of NP-Completeness
    • 47,277
    • PDF
    Production Sets with Indivisibilities Part I: Generalities
    • 86
    An Introduction to the Geometry of Numbers
    • 1,123
    • PDF
    Systems of distinct representatives and linear algebra
    • 331
    • PDF