A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning

From MaRDI portal
Revision as of 02:45, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 (21)

Heuristics for multi-period capacity expansion in local telecommunications networksNetwork flow models for the local access network expansion problemA reliable model for global planning of mobile networksFormulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problemA node rooted flow-based model for the local access network expansion problemOptimizing constrained subtrees of treesBenders decomposition approach for the robust network design problem with flow bifurcationsMathematical formulations for multi-period network design with modular capacity adjustmentsValid inequalities for non-unit demand capacitated spanning tree problems with flow costsMulti-period capacitated location with modular equipmentsEquitable bandwidth allocation in content distribution networksA two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband accessMulti-period capacity expansion for a local access telecommunications networkMulti-period maintenance scheduling of tree networks with minimum flow disruptionTowards optimizing the deployment of optical access networksThe network redesign problem for access telecommunications networksA model for the capacitated, hop-constrained, per-packet wireless mesh network design problemSolution of a certain class of network flow problems with cascaded demand aggregation and capacity allocationA dynamic programming algorithm for the local access telecommunication network expansion problemA tabu search algorithm for the optimisation of telecommunication networksAbout Lagrangian methods in integer optimization







This page was built for publication: A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning