Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1142819 | Operations Research Letters | 2008 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Carlos Obreque, Vladimir Marianov, Miguel Ríos,