A New Efficient Heuristic for the Minimum Set Covering Problem

DOI10.1057/jors.1995.173zbMath0845.90090OpenAlexW2051561306MaRDI QIDQ4864354

Vangelis Th. Paschos, Mohamed Afif, Mhand Hifi, Vassilios Zissimopoulos

Publication date: 16 September 1996

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

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

zbMATH Keywords

heuristiccombinatorial analysisgreedy heuristiccomputational analysisminimum set covering

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Related Items (2)

Evaluation of reliability bounds by set covering models. ⋮ Fuzzy logic based algorithms for maximum covering location problems

This page was built for publication: A New Efficient Heuristic for the Minimum Set Covering Problem