Author:
Arora S. R.,Shanker Ravi,Malhotra Neelam
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,Computer Science Applications,Information Systems,Management Information Systems
Reference14 articles.
1. Garfinkel, R.S. and Nemhauser, G.L. (ed.) (1973): “Integer programming”, Wiley Inter Science Publication, John Wiley.
2. Roth, R. (1969): “Computer solution to minimum cover problem”, Operations Research, Vol. 17, p. 455–465.
3. Lemke, C.E., Salkin, H.M. and Spielberg, K. (1971): “Set covering by single branch enumeration with linear programming subproblem”, Operations Research, Vol. 19, p. 998–1022.
4. Bellmore, M. and Ratliff, H.D. (1971): “Set covering and involutory basis”, Management Sciences, Vol. 18, p. 194–206.
5. Chavatal, V. (1979): “A greedy heuristic for the set covering problem”, Mathematics of Operations Research, Vol. 4, p. 233–235.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献