Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems

DOI10.1287/opre.43.1.43zbMath0830.90048OpenAlexW2123656547MaRDI QIDQ4838236

Suk-Gwon Chang, Bezalel Gavish

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.43

zbMATH Keywords

Lagrangian relaxationtelecommunicationcapacity expansion problemmultiperiod network topology

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (10)

Heuristics for multi-period capacity expansion in local telecommunications networks ⋮ Matheuristics: survey and synthesis ⋮ Mathematical formulations for multi-period network design with modular capacity adjustments ⋮ Selection, acquisition, and allocation of manufacturing technology in a multi-period environment ⋮ Multi-period capacity expansion for a local access telecommunications network ⋮ Bundle-based relaxation methods for multicommodity capacitated fixed charge network design ⋮ Towards optimizing the deployment of optical access networks ⋮ A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem ⋮ A dynamic programming algorithm for the local access telecommunication network expansion problem ⋮ About Lagrangian methods in integer optimization

This page was built for publication: Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems