14 citations · 22 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…
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…
An Efficient Algorithm for the Fast Delivery Problem
Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos
We study a problem where k autonomous mobile agents are initially located on distinct nodes of a weighted graph (with n nodes and m edges). Each autonomous mobile agent has a prede…
On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions
Iago A Carvalho
The experimental evaluation of algorithms results in a large set of data which generally do not follow a normal distribution or are not heteroscedastic. Besides, some of its entrie…