collaborators

1 paper

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…