A parallel GRASP for the Steiner problem in graphs
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for
combinatorial optimization. Given an undirected graph with weights associated with its …
combinatorial optimization. Given an undirected graph with weights associated with its …
Modern heuristic search methods for the Steiner tree problem in graphs
S Voß - Advances in Steiner Trees, 2000 - Springer
Modern heuristic search methods for the Steiner tree problem in graphs Page 289 Modern
Heuristic Search Methods for the Steiner Tree Problem in Graphs Stefan Vofi Technische …
Heuristic Search Methods for the Steiner Tree Problem in Graphs Stefan Vofi Technische …
Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs
H Akbari, Z Iranmanesh… - … Conference on Parallel …, 2007 - ieeexplore.ieee.org
Given an undirected graph with weights associated with its edges, the Steiner tree problem
consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes of …
consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes of …
A new Steiner tree algorithm based on Sollin's algorithm in graphs
E Pashaei, A Nourollah… - 2012 IEEE International …, 2012 - ieeexplore.ieee.org
The minimum Steiner tree problem, a classical combinatorial optimization problem with a
long history, is a NP-complete problem. Due to its wide application, study of heuristic …
long history, is a NP-complete problem. Due to its wide application, study of heuristic …
[PDF][PDF] Improved Minimum Spanning Tree Heuristics for Steiner Tree problem in graph
The minimum Steiner tree problem, a classical combinatorial optimization problem with a
long history, is a NP-complete problem. Due to its wide application, study of heuristic …
long history, is a NP-complete problem. Due to its wide application, study of heuristic …
[PDF][PDF] TESIS DE MAESTRÍA EN INFORMÁTICA
AG PARALELOS - 2004 - academia.edu
Esta Tesis presenta el estudio de las técnicas de computación evolutiva y la aplicación de
técnicas de procesamiento de alta performance para implementar modelos de algoritmos …
técnicas de procesamiento de alta performance para implementar modelos de algoritmos …
Discusión y análisis de la metaheurística SN
P Rodríguez Bocca - 2003 - lareferencia.info
Una metaheurística es un conjunto de ideas relacionadas que tienen por objetivo la
resolución aproximada de problemas de optimización combinatoria. Esta trabajo describe …
resolución aproximada de problemas de optimización combinatoria. Esta trabajo describe …
[PDF][PDF] INSTANCIAS DE PRUEBA DEL PROBLEMA DE STEINER GENERALIZADO
W DE OCCAM - TESIS DE MAESTRÍA EN INFORMÁTICA, 2004 - fing.edu.uy
Uno de los principales problemas de construcción de redes de comunicaciones plantea el
diseño de una topología de interconexión de sus nodos de modo que la red verifique ciertas …
diseño de una topología de interconexión de sus nodos de modo que la red verifique ciertas …