Telecommunication and location
This paper deals with location problems arising in the telecommunications context. In a typical telecommunication network, the traffic is gathered from many sources, progressively combined in order to fill links of increasing capacity and finally forwarded to its destination. A generic telecommunication network consists of access networks which connect the terminals to concentrators and a backbone network which interconnects these concentrators or connects them to a central unit. In the design phase a decision about the number and locations of concentrators as well as the assignment of the terminals to these concentrators has to be made. Thereafter access network and backbone network is designed. The authors first investigate location models for concentrators and the assignment of terminals to these concentrators assuming that there is no capacity constraint for these concentrators. The tight connection to the classical uncapacitated facility location problem is elaborated. The next section is devoted to the capacitated case where polyhedral properties are presented. Moreover, Langrangian relaxation based heuristics are developed. These results are used to discuss the design of a capacitated telecommunication network. Finally, dynamic models are briefly described. For the entire collection see [Zbl 0988.00044].
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- The \(K\)-coverage concentrator location problem
- Multi-level facility location problems
- Concentrator location in telecommunications networks.
- A branch and cut algorithm for hub location problems with single assignment
- Concentrator location in telecommunications
- Locating median cycles in networks
- Optimizing splitter and fiber location in a multilevel optical FTTH network
- The double-assignment plant location problem with co-location
- Multi-period capacitated location with modular equipments
- Towards optimizing the deployment of optical access networks
- Exactly solving a two-level location problem with modular node capacities
- Survivability in hierarchical telecommunications networks under dual homing
- scientific article; zbMATH DE number 3883910 (Why is no real title available?)
- A branch-and-cut algorithm for two-level survivable network design problems
- Combined capacity planning and concentrator location in computer communications networks
- Location of Transfer Centres on Segments of a Communication Network with Proportional Traffic
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location
- Location problems in telecommunications
- Solving the hub location problem in a star–star network
- scientific article; zbMATH DE number 2247883 (Why is no real title available?)
- New variants of the simple plant location problem and applications
- A survivable variant of the ring star problem
- Polyhedral analysis for concentrator location problems
- A review of hierarchical facility location models
- Optimal design of hierarchical networks with free main path extremes
- On split-coloring problems
This page was built for publication: Telecommunication and location
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147665)
