Portal del Investigador
Optimal design of hierarchical networks with free main path extremes
Abstract
We propose an optimal, two-stage procedure for the optimal design of minimum cost hierarchical spanning networks, consisting of a main path and secondary trees. The optimal location of the origin and destination nodes of the path is also found. We test our procedure and compare it with a known method. © 2007 Elsevier Ltd. All rights reserved.
Más información
| Título según WOS: | Optimal design of hierarchical networks with free main path extremes |
| Título según SCOPUS: | Optimal design of hierarchical networks with free main path extremes |
| Título de la Revista: | OPERATIONS RESEARCH LETTERS |
| Volumen: | 36 |
| Número: | 3 |
| Editorial: | Elsevier |
| Fecha de publicación: | 2008 |
| Página de inicio: | 366 |
| Página final: | 371 |
| Idioma: | English |
| DOI: |
10.1016/j.orl..2007.10.007 |
| Notas: | ISI, SCOPUS |