#### Filter Results:

- Full text PDF available (15)

#### Publication Year

1998

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Celso C. Ribeiro, Maurício C. de Souza
- Networks
- 2000

Given an undirected graph with weights associated with its nodes, the Steiner tree problem consists in nding a minimum weight subgraph spanning a given subset of nodes (terminals) of the original graph. In this paper, we describe an improved tabu search algorithm for the Steiner problem in graphs, based on a neighborhood deened by insertions and… (More)

- Simone L. Martins, Celso C. Ribeiro, Maurício C. de Souza
- IRREGULAR
- 1998

A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. Given an undirected graph with weights associated with its nodes, the Steiner tree problem consists in nding a minimum weight subgraph spanning a given subset of (terminal) nodes of the original graph. In this paper, we describe a parallel GRASP for the… (More)

- Christophe Duhamel, Luís Gouveia, Pedro Moura, Maurício C. de Souza
- Networks
- 2008

- Alexandre Xavier Martins, Maurício C. de Souza, Marcone J. F. Souza, Túlio A. M. Toffolo
- J. Heuristics
- 2009

We propose a GRASP using an hybrid heuristic-subproblem optimization approach for the Multi-Level Capacitated Minimum Spanning Tree (MLCMST) problem. The motivation behind such approach is that to evaluate moves rearranging the configuration of a subset of nodes may require to solve a smaller-sized MLCMST instance. We thus use heuristic rules to define, in… (More)

- Celso C. Ribeiro, Maurício C. de Souza
- Discrete Applied Mathematics
- 2002

Given an undirected graph with weights associated with its edges, the degree-constrained minimum spanning tree problem consists in nding a minimum spanning tree of the given graph, subject to constraints on node degrees. We propose a variable neighborhood search heuristic for the degree-constrained minimum spanning tree problem, based on a dynamic… (More)

We describe a new neighborhood structure for the capacitated minimum spanning tree problem. This neighborhood structure is used by a local search strategy, leading to good trade-offs between solution quality and computation time. We also propose a GRASP with path-relinking heuristic. It uses a randomized version of a savings heuristic in the construction… (More)

- Maurício C. de Souza, Pedro Martins
- European Journal of Operational Research
- 2008

- Christophe Duhamel, Luís Gouveia, Pedro Moura, Maurício C. de Souza
- Networks
- 2012

- Ana de Almeida, Pedro Martins, Maurício C. de Souza
- ITOR
- 2012

Given an undirected graph G = (V, E) and a function d : V → N , the Min-Degree Constrained Minimum Spanning Tree (md-MST) problem is to find a minimum cost spanning tree T of G where each node i ∈ V has minimum degree d(i) or is a leaf node. This problem is closely related with the well-known Degree Constrained Minimum Spanning Tree (d-MST) problem, where… (More)

- Alexandre Xavier Martins, Christophe Duhamel, Philippe Mahey, Rodney Rezende Saldanha, Maurício C. de Souza
- Computers & OR
- 2012