On the complexity of integer programming
- 1 October 1981
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 28 (4), 765-768
- https://doi.org/10.1145/322276.322287
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- `` Strong '' NP-Completeness ResultsJournal of the ACM, 1978
- On the Computational Complexity of Integer Programming ProblemsPublished by Springer Nature ,1978
- Bounds on positive integral solutions of linear Diophantine equationsProceedings of the American Mathematical Society, 1976