A probabilistic heuristic for a computationally difficult set covering problem
- 1 April 1989
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 8 (2) , 67-71
- https://doi.org/10.1016/0167-6377(89)90002-3
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Semi-greedy heuristics: An empirical studyOperations Research Letters, 1987
- A note on some computationally difficult set covering problemsMathematical Programming, 1980
- 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
- Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systemsPublished by Springer Nature ,1974
- An Improved Implicit Enumeration Approach for Integer ProgrammingOperations Research, 1969