A hybrid heuristic for the set covering problem
- 22 September 2010
- journal article
- Published by Springer Nature in Operational Research
- Vol. 12 (3) , 345-365
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Tabu Search-Based Metaheuristic Algorithm for Large-scale Set Covering Problems2007
- An indirect genetic algorithm for set covering problemsJournal of the Operational Research Society, 2002
- Algorithms for the Set Covering ProblemAnnals of Operations Research, 2000
- A Heuristic Method for the Set Covering ProblemOperations Research, 1999
- A morphing procedure to supplement a simulated annealing heuristic for cost‐ andcoverage‐correlated set‐covering problemsAnnals of Operations Research, 1999
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set CoveringOperations Research, 1996
- A genetic algorithm for the set covering problemEuropean Journal of Operational Research, 1996
- Enhancing an algorithm for set covering problemsEuropean Journal of Operational Research, 1992
- A lagrangian heuristic for set-covering problemsNaval Research Logistics (NRL), 1990
- An algorithm for set covering problemEuropean Journal of Operational Research, 1987