Optimal design of hierarchical networks with free main path extremes
link https://doi.org/10.1016/j.orl.2007.10.007get_app2024-04-03. Optimal design of hierarchical networks with free main path extremes.pdf
account_box Obreque, Carlosaccount_box Marianov, Vladimiraccount_box Rios, Miguel
Comparte este registro
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. (C) 2007 Elsevier B.V. All rights reserved.
Registro Sencillo
Registro Completo
| Autor | Obreque, Carlos Marianov, Vladimir Rios, Miguel |
| Título | Optimal design of hierarchical networks with free main path extremes |
| Revista | OPERATIONS RESEARCH LETTERS |
| ISSN | 0167-6377 |
| ISSN electrónico | 1872-7468 |
| Volumen | 36 |
| Número de publicación | 3 |
| Página inicio | 366 |
| Página final | 371 |
| Fecha de publicación | 2008 |
| Resumen | 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. (C) 2007 Elsevier B.V. All rights reserved. |
| Derechos | acceso restringido |
| DOI | 10.1016/j.orl.2007.10.007 |
| Editorial | ELSEVIER SCIENCE BV |
| Enlace | |
| Id de publicación en WoS | WOS:000256609400020 |
| Paginación | 6 páginas |
| Palabra clave | hierarchical networks integer programming heuristics FORMULATION |
| Tema ODS | 11 Sustainable Cities and Communities |
| Tema ODS español | 11 Ciudades y comunidades sostenibles |
| Tipo de documento | artículo |