Pages that link to "Item:Q835760"
From MaRDI portal
The following pages link to Heuristics for multi-period capacity expansion in local telecommunications networks (Q835760):
Displaying 16 items.
- A heuristic approach for capacity expansion of packet networks (Q1278229) (← links)
- Iterative improvement methods for a multiperiod network design problem (Q1303714) (← links)
- A dynamic programming algorithm for the local access telecommunication network expansion problem (Q1590815) (← links)
- Relief period optimization under budget constraints (Q1600951) (← links)
- Diversification strategies in local search for a nonbifurcated network loading problem (Q1848356) (← links)
- An efficient heuristic for the expansion problem of cellular wireless networks (Q1885950) (← links)
- A quantitative approach for the long-term assessment of railway rapid transit network construction or expansion projects (Q2239999) (← links)
- Multi-period capacity expansion for a local access telecommunications network (Q2488926) (← links)
- A node rooted flow-based model for the local access network expansion problem (Q2654316) (← links)
- A heuristic approach to satellite link capacity planning applied in mobile networks (Q2768223) (← links)
- Heuristic algorithms for the optimisation of telecommunication networks (Q2771280) (← links)
- A heuristic for capacity expansion planning with multiple facility types (Q3740525) (← links)
- Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems (Q4838236) (← 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)
- Using heuristic algorithms for capacity leasing and task allocation issues in telecommunication networks under fuzzy quality of service constraints (Q5172561) (← links)
