2 papers
math.OC2020
An Iterated Dual Substitution Approach for Binary Integer Programming Problems under the Min-Max Regret Criterion
Wei Wu, Manuel Iori, Silvano Martello +1
We consider binary integer programming problems with the min-max regret objective function under interval objective coefficients. We propose a new heuristic framework, which we cal…
cs.DS2017
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…