Integer Programming with a Fixed Number of Variables

1 November 1983

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research

Vol. 8 (4), 538-548
https://doi.org/10.1287/moor.8.4.538

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.

Keywords

GEOMETRY
FIXED NUMBER
INTEGER PROGRAMMING
INTEGER LINEAR
PROGRAMMING PROBLEM
POLYNOMIALLY SOLVABLE
LINEAR PROGRAMMING

Cited by 857 articles