Pages that link to "Item:Q1590815"
From MaRDI portal
The following pages link to A dynamic programming algorithm for the local access telecommunication network expansion problem (Q1590815):
Displaying 12 items.
- Heuristics for multi-period capacity expansion in local telecommunications networks (Q835760) (← links)
- Network flow models for the local access network expansion problem (Q856692) (← links)
- A dynamic programming algorithm for the local access telecommunication network expansion problem (Q1590815) (← links)
- Modeling the steering of international roaming traffic (Q1753618) (← links)
- A MIP-based approach to solve the prize-collecting local access network design problem (Q2256343) (← links)
- Multi-period capacity expansion for a local access telecommunications network (Q2488926) (← links)
- Towards optimizing the deployment of optical access networks (Q2513732) (← links)
- A node rooted flow-based model for the local access network expansion problem (Q2654316) (← links)
- Equitable bandwidth allocation in content distribution networks (Q3553745) (← links)
- A Reach and Bound algorithm for acyclic dynamic-programming networks (Q3632964) (← links)
- A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning (Q4838237) (← links)
- An Efficient Algorithm for the Multiperiod Capacity Expansion of One Location in Telecommunications (Q4838249) (← links)
