Pages that link to "Item:Q4838237"

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

Displaying 12 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)
• About Lagrangian methods in integer optimization (Q817183) (← 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)
• 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)
• Optimizing constrained subtrees of trees (Q1914069) (← links)
• Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs (Q1969869) (← 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)