A dynamic programming algorithm for the local access telecommunication network expansion problem
From MaRDI portal
Publication:1590815
DOI10.1016/S0377-2217(99)00340-9zbMath0979.90016OpenAlexW2076238711MaRDI QIDQ1590815
Olaf E. Flippo, Arie M. C. A. Koster, Robert L. M. J. van de Leensel, Antoon W. J. Kolen
Publication date: 21 December 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00340-9
Related Items
Heuristics for multi-period capacity expansion in local telecommunications networks, Network flow models for the local access network expansion problem, A node rooted flow-based model for the local access network expansion problem, Equitable bandwidth allocation in content distribution networks, Modeling the steering of international roaming traffic, Multi-period capacity expansion for a local access telecommunications network, Towards optimizing the deployment of optical access networks, A dynamic programming algorithm for the local access telecommunication network expansion problem
Cites Work
- Models for planning capacity expansion in local access telecommunication networks
- Packing and covering a tree by subtrees
- Topological design of telecommunication networks --- local access design methods
- Dynamic programming based heuristics for the topological design of local access networks
- Topological design of computer communication networks -- the overall design problem
- Locating concentrators in centralized computer networks
- A characterization of the uncapacitated network design polytope
- Optimal expansion of capacitated transshipment networks
- Minimum cost capacity installation for multicommodity network flows
- A suboptimal solution to a hierarchical network design problem using dynamic programming
- A dynamic programming algorithm for the local access telecommunication network expansion problem
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- A decomposition algorithm for capacity expansion of local access networks
- A Dual-Based Algorithm for Multi-Level Network Design
- Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
- Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems
- A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
- Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
- Capacitated Network Design—Polyhedral Structure and Computation
- Design and Implementation of an Interactive Optimization System for Telephone Network Planning
