On the Computational Complexity of Integer Programming Problems

This publication has 9 references indexed in Scilit:

• A Min-Max Relation for Submodular Functions on Graphs
  Published by Elsevier ,1977
• Bounds on positive integral solutions of linear Diophantine equations
  Proceedings of the American Mathematical Society, 1976
• A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
  Journal of the ACM, 1976
• Computationally Related Problems
  SIAM Journal on Computing, 1974
• Reducibility among Combinatorial Problems
  Published by Springer Nature ,1972
• Algorithms for Hermite and Smith normal matrices and linear Diophantine equations
  Mathematics of Computation, 1971
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971
• Algorithm and bound for the greatest common divisor of n integers
  Communications of the ACM, 1970
• The Theory and Computation of Knapsack Functions
  Operations Research, 1966