A decomposition algorithm for capacity expansion of local access networks
From MaRDI portal
Publication:4274755
DOI10.1109/26.231937zbMath0800.94326OpenAlexW2133139082MaRDI QIDQ4274755
Rita Vachani, Alexander Shulman
Publication date: 6 January 1994
Published in: IEEE Transactions on Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/26.231937
Related Items
A global optimization algorithm for reliable network design ⋮ Network flow models for the local access network expansion problem ⋮ A node rooted flow-based model for the local access network expansion problem ⋮ On the minimization of possibly discontinuous functions by means of pointwise approximations ⋮ A new approach for solving the network problems ⋮ A graph theoretic-based heuristic algorithm for responsive supply chain network design with direct and indirect shipment ⋮ A dynamic programming algorithm for the local access telecommunication network expansion problem ⋮ Models for planning capacity expansion in local access telecommunication networks
