TY - GEN A1 - Bley, Andreas A1 - Koch, Thorsten A1 - Wessäly, Roland T1 - Large-scale hierarchical networks: How to compute an optimal architecture? N2 - 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. Y1 - 2004 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/131 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-1311 ER -