Relaxation heuristics for the set multicover problem with generalized upper bound constraints

Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura

We consider an extension of the set covering problem (SCP) introducing (i)~multicover and (ii)~generalized upper bound (GUB)~constraints. For the conventional SCP, the pricing meth…