Worst case analysis of a class of set covering heuristics
- 1 December 1982
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 23 (1), 170-180
- https://doi.org/10.1007/bf01583786
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational studyPublished by Springer Nature ,1980
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972