2 papers
math.OC2021
A min-max regret approach for the Steiner Tree Problem with Interval Costs
Iago A. Carvalho, Amadeu A. Coco, Thiago F. Noronha +1
Let G=(V,E) be a connected graph, where V and E represent, respectively, the node-set and the edge-set. Besides, let Q \subseteq V be a set of terminal nodes, and r \in Q be the ro…
cs.DS2019
Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data
Iago A. Carvalho, Thiago F. Noronha, Christophe Duhamel
We address the Interval Data Min-Max Regret 0-1 Integer Linear Programming problem (MMR-ILP), a variant of the 0-1 Integer Linear Programming problem where the objective function c…