Using a facility location algorithm to solve large set covering problems
- 30 June 1984
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 3 (2) , 85-90
- https://doi.org/10.1016/0167-6377(84)90047-6
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- An efficient heuristic for large set covering problemsNaval Research Logistics Quarterly, 1984
- Worst case analysis of a class of set covering heuristicsMathematical Programming, 1982
- Efficient heuristic algorithms for the weighted set covering problemComputers & Operations Research, 1981
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- A Dual-Based Procedure for Uncapacitated Facility LocationOperations Research, 1978
- Computer Solutions to Minimum-Cover ProblemsOperations Research, 1969