A decomposition algorithm for capacity expansion of local access networks

DOI10.1109/26.231937MaRDI QIDQ4274755zbMATH OpenOpenAlexFDO

Authors Alexander Shulman, Rita Vachani

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

Mathematics Subject Classification ID

Circuits, networks (94C99)

Cited in

(8)

• A dynamic programming algorithm for the local access telecommunication network expansion problem
• On the minimization of possibly discontinuous functions by means of pointwise approximations
• A global optimization algorithm for reliable network design
• A node rooted flow-based model for the local access network expansion problem
• 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
• Models for planning capacity expansion in local access telecommunication networks
• Network flow models for the local access network expansion problem

This page was built for publication: A decomposition algorithm for capacity expansion of local access networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4274755)