Concentrator location in telecommunications networks.
From MaRDI portal
Publication:1762564
zbMath1083.90034MaRDI QIDQ1762564
Publication date: 10 February 2005
Published in: Combinatorial Optimization (Search for Journal in Brave)
mixed integer programmingbranch and cut algorithmtelecommunication networkconcentrator locationlocation and network design
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Combinatorics in computer science (68R05) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Polyhedral analysis for concentrator location problems, Solving the hub location problem with modular link capacities, General network design: a unified view of combined location and network design problems, Quantum−like nonseparable structures in optical beams, Classical entanglement in polarization metrology, 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, Solving the hub location problem in a star–star network, Towards optimizing the deployment of optical access networks, Modeling the capacitated \(p\)-cable trench problem with facility costs
