Definition
Minimum Set Cover Optimisation Problem
Instance: A finite universe
and an indexed family . Feasible solutions: Index sets
satisfying . Objective: Minimise
:
A solution selects a set cover of minimum cardinality, not merely one from which no set can be removed. If, the instance is infeasible; if , the empty selection is optimal.