LCS Publication Details
Publication Title: ON THE COMPLEXITY OF INTEGER PROGRAMMING
Publication Author: Papadimitriou, Christos H.
Additional Authors:
LCS Document Number: MIT-LCS-TM-152
Publication Date: 2-1-1980
LCS Group: No Group Specified
Additional URL: No URL Given
Abstract:
We give a simple proof that integer programming is in NP. Our proof also establishes that there is a pseudopolynomial time algorithm for integer programming with any (fixed) number of constraints.
To obtain this publication:

    To purchase a printed copy of this publication please contact MIT Document Services.