On the Computational Complexity of Integer Programming Problems
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .
[3] Ralph E. Gomory,et al. The Theory and Computation of Knapsack Functions , 1966, Oper. Res..
[4] G. Nemhauser,et al. Integer Programming , 2020 .
[5] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[6] Chak-Kuen Wong,et al. A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables , 1976, JACM.
[7] Gordon H. Bradley,et al. Algorithm and bound for the greatest common divisor of n integers , 1970, CACM.
[8] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[9] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .
[10] G. H. Bradley. Algorithms for Hermite and Smith normal matrices and linear Diophantine equations , 1971 .
[11] Richard M. Karp,et al. On the Computational Complexity of Combinatorial Problems , 1975, Networks.
[12] Sartaj Sahni,et al. Computationally Related Problems , 1974, SIAM J. Comput..
[13] I. Borosh,et al. Bounds on positive integral solutions of linear Diophantine equations , 1976 .