activity
20192021
most citedOn the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-max Regret Optimization Problems with Interval Costs

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

collaborators
Showing math.OCShow all

1 paper · 1 filter

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…