On the complexity of integer programming

@article{Papadimitriou1981OnTC,
  title={On the complexity of integer programming},
  author={C. Papadimitriou},
  journal={J. ACM},
  year={1981},
  volume={28},
  pages={765-768}
}
A simple proof that integer programming ts in X~ ~s given. The proof also estabhshes that there ~s a pseudopolynomial-tune algorithm for integer programmmg with any (fixed) number of constraints. 
476 Citations
Solving Linear Integer Arithmetic
Cutting to the Chase Solving Linear Integer Arithmetic
  • 62
  • PDF
Cutting to the Chase
  • 24
Technical Note - Recognizing Unbounded Integer Programs
  • 11
On Solving Boolean Combinations of Generalized 2SAT Constraints
  • 3
  • PDF
On Integer Programming and the Branch-Width of the Constraint Matrix
  • 24
  • PDF
FPT-algorithms for some problems related to integer programming
  • 6
  • PDF
A Linear Characterization of NP-Complete Problems
  • S. Ursic
  • Mathematics, Computer Science
  • CADE
  • 1984
  • 12
...
1
2
3
4
5
...