Marcus Poggi de Arag~ao (2007)
Isabel Rosseti, Celso C. Ribeiro, Eduardo Uchoa, Renato F. Werneck
Let G = (V; E) be a connected undirected graph, where V is the set of nodes and E denotes the set of edges. Given a non-negative weight function w: E! IR + associated with its edges and a subset
Abstract Efficient parallel cooperative implementations of GRASP heuristics (2007)
Celso C. Ribeiro, Isabel Rosseti
We propose a parallel cooperative strategy for the implementation of the GRASP metaheuristic and we illustrate it with a GRASP with path-relinking heuristic for the 2-path network design problem....
New benchmark instances for the Steiner problem in graphs (2001)
Isabel Rosseti, Celso C. Ribeiro, Eduardo Uchoa, Renato F. Werneck
Abstract. We propose in this work 50 new test instances for the Steiner problem in graphs. These instances are characterized by large integrality gaps (between the optimal integer solution and that...