Design of Communication Networks with Survivability Constraints
From MaRDI portal
Publication:3116635
DOI10.1287/mnsc.45.2.238zbMath1231.90120MaRDI QIDQ3116635
Dong-wan Tcha, Young-Soo Myung, Hyun-Joon Kim
Publication date: 12 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/efc12b643fd97a521dbeed549439939a075c5387
90C10: Integer programming
90B18: Communication networks in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Towards minimumk-geodetically connected graphs, Multi-period maintenance scheduling of tree networks with minimum flow disruption, The multi-terminal maximum-flow network-interdiction problem, A cutting plane algorithm for computing \(k\)-edge survivability of a network, Survivable network design under optimal and heuristic interdiction scenarios, Minimumk-geodetically connected digraphs