most citedRelaxation heuristics for the set multicover problem with generalized upper bound constraints

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2017★ 2 cited

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…