Pages that link to "Item:Q4838237"

The following pages link to A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning (Q4838237):

Displaying 29 items.

• A reliable model for global planning of mobile networks (Q336498) (← links)
• Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← links)
• Transmission facility planning in telecommunications networks: A heuristic approach (Q788618) (← links)
• About Lagrangian methods in integer optimization (Q817183) (← links)
• B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty (Q817201) (← links)
• 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 model for the capacitated, hop-constrained, per-packet wireless mesh network design problem (Q1014998) (← links)
• Topological design of telecommunication networks --- local access design methods (Q1179728) (← 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)
• A tabu search algorithm for the optimisation of telecommunication networks (Q1609900) (← links)
• Multicommodity network expansion under elastic demands (Q1863858) (← links)
• Maximal covering code multiplexing access telecommunication networks (Q1876173) (← links)
• Optimizing constrained subtrees of trees (Q1914069) (← links)
• Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs (Q1969869) (← links)
• Multi-period capacitated location with modular equipments (Q2456628) (← links)
• A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access (Q2488215) (← 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)
• Benders decomposition for local access network design with two technologies (Q2752468) (← links)
• Equitable bandwidth allocation in content distribution networks (Q3553745) (← links)
• A nested benders decomposition approach for telecommunication network planning (Q3588806) (← links)
• The network redesign problem for access telecommunications networks (Q4266755) (← links)
• Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems (Q4838236) (← links)
• Multi-period maintenance scheduling of tree networks with minimum flow disruption (Q5198690) (← links)
• Benders decomposition approach for the robust network design problem with flow bifurcations (Q5326799) (← links)
• Solution of a certain class of network flow problems with cascaded demand aggregation and capacity allocation (Q5481686) (← links)