Survivable network design using polyhedral approaches


We consider the problem of designing a survivable telecommunication network using facilities of a fixed capacity. Given a graph G = (V,E), the traffic demand among the nodes, and the cost of installing facilities on the edges of G, we wish to design the minimum cost network, so that under any single edge failure, the network permits the flow of all traffic… (More)
DOI: 10.1109/COMSNETS.2011.5716411

5 Figures and Tables


  • Presentations referencing similar topics