Year
2014
Authors
Abstract
We propose an approximation heuristic for a NP-hard clustered variant of the Set Covering Problem where subsets are partitionned into K clusters and a fixed cost is paid for selecting at least one subset in a cluster.
ALFANDARI, L. et MONNOT, J. (2014). A Note on the Clustered Set Covering Problem. Discrete Applied Mathematics, 1(164), pp. 13-19.