A Genetic Algorithm for the Set Covering Problem

DOI10.1057/jors.1996.82zbMath0863.90114OpenAlexW2016207616MaRDI QIDQ4717130

J. S. Nizami, Khaled S. Al-Sultan, Mohammed F. Hussain

Publication date: 20 May 1997

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1996.82

zbMATH Keywords

heuristicsgenetic algorithmset coveringimplicit enumerationNP-complete problemLagrangian heuristic

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Boolean programming (90C09)

Related Items

On Multiple Coverings of Fixed Size Containers with Non-Euclidean Metric by Circles of Two Types ⋮ A distributed genetic algorithm for deterministic and stochastic labor scheduling problems ⋮ On reserve and double covering problems for the sets with non-Euclidean metrics