The following pages link to Iago A. Carvalho (Q1711418):
Displaying 9 items.
- On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions (Q1711419) (← links)
- A MILP-based VND for the min-max regret shortest path tree problem with interval costs (Q1791906) (← links)
- An exact approach for the minimum-cost bounded-error calibration tree problem (Q2178300) (← links)
- On the fast delivery problem with one or two packages (Q2208259) (← links)
- An efficient algorithm for the fast delivery problem (Q2291419) (← links)
- The widest<i>k</i>-set of disjoint paths problem (Q5880971) (← links)
- A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)
- On solving bi-objective constrained minimum spanning tree problems (Q6166107) (← links)
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty (Q6186579) (← links)
