Concentrator location in telecommunications networks.
branch and cut algorithmconcentrator locationlocation and network designmixed integer programmingtelecommunication network
Combinatorics in computer science (68R05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Communication networks in operations research (90B18) Discrete location and assignment (90B80) Mixed integer programming (90C11) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
The book provides a collection of results on concentrator location problems in telecommunication networks. A network is given as an edge weighted graph together with a traffic matrix denoting the desired communication traffic between pairs of nodes. A valid concentrator selection is a subset of the nodes with the property that each node is either selected or adjacent to a selected node. The goal is to find a concentrator selection of minimum cost, where costs arise both for opening a concentrator node, connecting the backbone network of concentrator nodes, and routing the traffic according to the traffic matrix. The author investigates several variants of the problem, including restrictions on the traffic capacity of concentrator nodes, and on the topology of the backbone network (star, complete graph). By examining the structure of the associated polyhedra she develops branch and cut algorithms for solving the variants. The work is justified by computational results.
- A hierarchical solution approach for a multicommodity distribution problem under a special cost structure
- A branch and cut algorithm for hub location problems with single assignment
- Concentrator location in telecommunications
- General network design: a unified view of combined location and network design problems
- Integer linear programming models for grid-based light post location problem
- Modeling the capacitated \(p\)-cable trench problem with facility costs
- Solving the hub location problem with modular link capacities
- Towards optimizing the deployment of optical access networks
- Integer linear programming model for grid-based wireless transmitter location problems
- scientific article; zbMATH DE number 1803762 (Why is no real title available?)
- scientific article; zbMATH DE number 2050768 (Why is no real title available?)
- Quantum-like nonseparable structures in optical beams
- Classical entanglement in polarization metrology
- Location problems in telecommunications
- Solving the hub location problem in a star–star network
- Approximation algorithm for optimal location of concentrators and design of capacitated survivable backbone networks
- SU(2) polarization evolution on higher-order Poincaré sphere by using general q-plate
- Polyhedral analysis for concentrator location problems
- Advances in location analysis
This page was built for publication: Concentrator location in telecommunications networks.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762564)
