A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
From MaRDI portal
Publication:4838237
DOI10.1287/opre.43.1.58zbMath0830.90047OpenAlexW2032971082MaRDI QIDQ4838237
Thomas L. Magnanti, Richard T. Wong, Anantaram Balakrishnan
Publication date: 1 August 1995
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.43.1.58
Related Items
Heuristics for multi-period capacity expansion in local telecommunications networks, Network flow models for the local access network expansion problem, A reliable model for global planning of mobile networks, Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem, A node rooted flow-based model for the local access network expansion problem, Optimizing constrained subtrees of trees, Benders decomposition approach for the robust network design problem with flow bifurcations, Mathematical formulations for multi-period network design with modular capacity adjustments, Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs, Multi-period capacitated location with modular equipments, Equitable bandwidth allocation in content distribution networks, A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access, Multi-period capacity expansion for a local access telecommunications network, Multi-period maintenance scheduling of tree networks with minimum flow disruption, Towards optimizing the deployment of optical access networks, The network redesign problem for access telecommunications networks, A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem, Solution of a certain class of network flow problems with cascaded demand aggregation and capacity allocation, A dynamic programming algorithm for the local access telecommunication network expansion problem, A tabu search algorithm for the optimisation of telecommunication networks, About Lagrangian methods in integer optimization
