摘要: Let A be a binary matrix of size m × n, let c T be a positive row vector of length n and let e be the column vector, all of whose m components are ones. The set-covering problem is to …
acm.org
sci-hub.se 参考文章(5)
Aho AV, JE Hopcroft, JD Ullman, The Design and Analysis of Computer Algorithms ,(1974)
Richard M. Karp, Reducibility Among Combinatorial Problems Journal of Symbolic Logic. ,vol. 40, pp. 219- 241 ,(2010) , 10.1007/978-3-540-68279-0_8
David S. Johnson, Approximation algorithms for combinatorial problems Journal of Computer and System Sciences. ,vol. 9, pp. 256- 278 ,(1974) , 10.1016/S0022-0000(74)80044-9
L. Lovász, On the ratio of optimal integral and fractional covers Discrete Mathematics. ,vol. 13, pp. 383- 390 ,(1975) , 10.1016/0012-365X(75)90058-8
L. A. Wolsey, G. L. Nemhauser, Integer programming ,(1972)