Large-scale hierarchical networks: How to compute an optimal architecture?
Please always quote using this URN:urn:nbn:de:0296-matheon-521
- In this article, we present a mathematical model and an algorithm to support one of the central strategic planning decisions of network operators: How to organize a large number of locations into an hierarchy of network levels? We propose a mixed-integer program and a Lagrangian relaxation based algorithm to model and solve this planning task. As one big advantage of this approach, not only solutions but also worst-case quality gurarantees can be provided. We present a solution for a G-WiN planning instance of DFN with 759 locations which has been computed in less than 30 minutes and which is (provably) less than 0.5 percent away from optimality.
Author: | Andreas Bley, Thorsten Koch, Roland Wessäly |
---|---|
URN: | urn:nbn:de:0296-matheon-521 |
Referee: | Martin Grötschel |
Document Type: | Preprint, Research Center Matheon |
Language: | English |
Date of first Publication: | 2004/03/30 |
Release Date: | 2004/01/20 |
Preprint Number: | 107 |