Economic spare capacity planning for DCS mesh-restorable networks
From MaRDI portal
Publication:1303707
DOI10.1016/S0377-2217(97)00199-9zbMath0936.90057MaRDI QIDQ1303707
Kyungsik Lee, Sungsoo Park, Kyungchul Park, Heesang Lee
Publication date: 25 May 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
integer programming; branch-and-cut algorithm; digital cross-connect system; spare channel assignment problem; synchronous transmission networks
90C90: Applications of mathematical programming
90C10: Integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
Cites Work
- A polyhedral approach to multicommodity survivable network design
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Unnamed Item