A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
From MaRDI portal
Recommendations
- A dynamic programming algorithm for the local access telecommunication network expansion problem
- A nested Benders decomposition approach for telecommunication network planning
- Heuristics for multi-period capacity expansion in local telecommunications networks
- Network flow models for the local access network expansion problem
- Multi-period capacity expansion for a local access telecommunications network
- An Efficient Algorithm for the Multiperiod Capacity Expansion of One Location in Telecommunications
- A new proximal decomposition algorithm for routing in telecommunication networks
- Benders decomposition for local access network design with two technologies
- Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems
- A node rooted flow-based model for the local access network expansion problem
Cited in
(29)- scientific article; zbMATH DE number 4053315 (Why is no real title available?)
- Benders decomposition for local access network design with two technologies
- Solution of a certain class of network flow problems with cascaded demand aggregation and capacity allocation
- Heuristics for multi-period capacity expansion in local telecommunications networks
- A tabu search algorithm for the optimisation of telecommunication networks
- Maximal covering code multiplexing access telecommunication networks
- Equitable bandwidth allocation in content distribution networks
- Benders decomposition approach for the robust network design problem with flow bifurcations
- Network flow models for the local access network expansion problem
- A dynamic programming algorithm for the local access telecommunication network expansion problem
- Multi-period capacitated location with modular equipments
- Optimizing constrained subtrees of trees
- Multicommodity network expansion under elastic demands
- About Lagrangian methods in integer optimization
- A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem
- Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs
- Mathematical formulations for multi-period network design with modular capacity adjustments
- A node rooted flow-based model for the local access network expansion problem
- Multi-period maintenance scheduling of tree networks with minimum flow disruption
- Multi-period capacity expansion for a local access telecommunications network
- A reliable model for global planning of mobile networks
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
- Transmission facility planning in telecommunications networks: A heuristic approach
- A nested Benders decomposition approach for telecommunication network planning
- B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty
- Towards optimizing the deployment of optical access networks
- A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access
- The network redesign problem for access telecommunications networks
- scientific article; zbMATH DE number 3883910 (Why is no real title available?)
This page was built for publication: A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4838237)
