Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements.

Please always quote using this URN: urn:nbn:de:0297-zib-944
  • We consider the important practical and theoretical problem of designing a low-cost communications network which can survive failures of certain network components. Our initial interest in this area was motivated by the need to design certain ``two-connected" survivable topologies for fiber optic communication networks of interest to the regional telephone companies. In this paper, we describe some polyhedral results for network design problems with higher connectivity requirements. We also report on some preliminary computational results for a cutting plane algorithm for various real-world and random problems with high connectivity requirements which shows promise for providing good solutions to these difficult problems. \def\NP{$\cal NP$}

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Author:Martin Grötschel, Clyde Monma, Mechthild Stoer
Document Type:ZIB-Report
Date of first Publication:1993/01/05
Series (Serial Number):ZIB-Report (SC-92-24)
Published in:Appeared in: Operations Research 43 (1995) 1012-1024
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.