A Parallel GRASP for the Steiner Problem in Graphs Using a Hybrid Local Search Strategy

Título:

A Parallel GRASP for the Steiner Problem in Graphs Using a Hybrid Local Search Strategy

Autor:

Celso da Cruz Carneiro Ribeiro

Ano:

2000

Revista:

Journal of Global Optimization

ISSN:

09255001

Tags:

Metaheurísticas

Problema de Steiner

Idioma:

Inglês

Buscar essa publicação no Google Acadêmico

Publicações com a mesma autoria

Solving Hard Constrained Shortest Path Problems by Lagrangean Relaxation and Branch-and-Bound Algorithms

Heuristics for the generalized median graph problem

Parallel Computer Models and Combinatorial Algorithms

A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs

Edge Coloring: A Natural Model for Sports Scheduling

Maximum weighted induced forests and trees: new formulations and a computational comparative review

Load Balancing in SPMD Applications

Extending time-to-target plots to multiple instances

Implication Graph and Quadratic 0-1 Optimization

A Graph Theory Approach to Subcontracting, Machine Duplication and Intercell Moves in Cellular Manufacturing