Economic spare capacity planning for DCS mesh-restorable networks

DOI10.1016/S0377-2217(97)00199-9zbMath0936.90057MaRDI QIDQ1303707

Heesang Lee, Kyungsik Lee, Kyungchul Park, Sungsoo Park

Publication date: 25 May 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

integer programmingbranch-and-cut algorithmdigital cross-connect systemspare channel assignment problemsynchronous transmission networks

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites Work

• Unnamed Item
• 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

This page was built for publication: Economic spare capacity planning for DCS mesh-restorable networks