Evaluating simple metaheuristics for the generalized steiner problem
This article presents the empirical evaluation of several simple metaheuristics applied to solve the Generalized Steiner Problem (GSP). This problem models the design of high-reliability communication networks, demanding a variable number of independent paths linking each pair of terminal nodes. GSP...
Guardado en:
| Autor principal: | Nesmachnow, Sergio |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2005
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/9606 http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Dec05-19.pdf |
| Aporte de: |
Ejemplares similares
-
Evaluando la calidad de metaheurísticas simples para el problema de Steiner generalizado
por: Nesmachnow, Sergio
Publicado: (2005) -
Metaheuristic approaches for MWT and MWPT problems
por: Dorzán, María Gisela, et al.
Publicado: (2011) -
A Genetic Algorithm Based Heuristic for the Design of pCycle Networks
por: Delgadillo, Remberto Emanuel, et al.
Publicado: (2015) -
A Metaheuristic Compendium for Scheduling Problems
por: Bermúdez, Carlos, et al.
Publicado: (2017) -
A new metaheuristic and its application to the Steiner problems in graphs
por: Urrutia, S., et al.