Optimal design of hierarchical networks with free main path extremes
Loading...
Date
2008
Journal Title
Journal ISSN
Volume Title
Publisher
ELSEVIER SCIENCE BV
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. (C) 2007 Elsevier B.V. All rights reserved.
Description
Keywords
hierarchical networks, integer programming, heuristics, FORMULATION