11 citations · 17 across the 4 of their papers we have counts for
4 papers
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…
On the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-max Regret Optimization Problems with Interval Costs
Lucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha +1
This paper addresses a class of problems under interval data uncertainty composed of min-max regret versions of classical 0-1 optimization problems with interval costs. We refer to…
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…
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
Lucas Assunção, Thiago F. Noronha, Andréa Cynthia Santos +1
This work deals with a class of problems under interval data uncertainty, namely interval robust-hard problems, composed of interval data min-max regret generalizations of classica…