Integer Programming with a Fixed Number of Variables

H. W. Lenstra

1983Published

1.0KCitations

0References

journal articleType

Abstract

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: Mathematics of Operations Research

Publisher: Institute for Operations Research and the Management Sciences (INFORMS)

View on DOI

Citations are the number of DOI-registered works in Crossref that cite this paper; references are how many works it cites. Full text is on the publisher site via the DOI link.