11 citations · 16 across the 2 of their papers we have counts for
2 papers
cs.DS2020★ 5 cited
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…
cs.DS2016★ 11 cited
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…