Large-scale hierarchical networks: How to compute an optimal architecture?
Please always quote using this URN:urn:nbn:de:0296-matheon-1311
- 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 a hierarchical network? We propose a solution approach that is based on mixed-integer programming and Lagrangian relaxation techniques. As major advantage, our approach provides not only solutions but also worst-case quality guarantees. Real-world scenarios with more than 750 locations have been solved within 30 minutes to less than 1% off optimality.
Author: | Andreas Bley, Thorsten Koch, Roland Wessäly |
---|---|
URN: | urn:nbn:de:0296-matheon-1311 |
Referee: | Martin Grötschel |
Document Type: | Preprint, Research Center Matheon |
Language: | English |
Date of first Publication: | 2004/07/11 |
Release Date: | 2004/04/27 |
Preprint Number: | 166 |