Large-scale hierarchical networks: how to compute an optimal architecture?

@article{Bley2004LargescaleHN,
  title={Large-scale hierarchical networks: how to compute an optimal architecture?},
  author={Andreas Bley and Tobias Koch and Roland Wessaly},
  journal={11th International Telecommunications Network Strategy and Planning Symposium. NETWORKS 2004,},
  year={2004},
  pages={429-434}
}
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… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-7 of 7 references

DISCNET – Network optimization software package, 2000–2003

  • atesio GmbH
  • 2003
1 Excerpt

Dimensioning Survivable Capacitated NETworks

  • R. Wessäly
  • PhD thesis, Technische Universität Berlin, April
  • 2000
2 Excerpts

Optimierung des G-WiN

  • A. Bley, T. Koch
  • DFN-Mitteilungen, 54:13–15
  • 2000

Similar Papers

Loading similar papers…