BOOK-CHAPTER

Experiences with a Cutting Plane Algorithm in Survivable Network Design

Abstract

The problem of survivable network design came from an application of telecommunications industry, where network topologies are required to be connected after a failure of a certain number of links or nodes. One way to model survivability, accepted by practitioners at Bell Communkations Research, is the following.

Keywords:
Survivability Network topology Computer network Network planning and design Computer science Distributed computing Engineering

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
4
Refs
0.40
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Mobile Ad Hoc Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
Interconnection Networks and Systems
Physical Sciences →  Computer Science →  Computer Networks and Communications
DNA and Biological Computing
Life Sciences →  Biochemistry, Genetics and Molecular Biology →  Molecular Biology

Related Documents

JOURNAL ARTICLE

A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems

Geir DahlMechthild Stoer

Journal:   INFORMS journal on computing Year: 1998 Vol: 10 (1)Pages: 1-11
BOOK-CHAPTER

A Cutting Plane Algorithm for the Design of survivable Networks

Mechthild Stoer

Operations research proceedings Year: 1992 Pages: 578-584
JOURNAL ARTICLE

Survivable network design with demand uncertainty

S.E. TerblanchéRoland WessälyJ.M. Hattingh

Journal:   European Journal of Operational Research Year: 2010 Vol: 210 (1)Pages: 10-26
JOURNAL ARTICLE

A unified algorithm for degree bounded survivable network design

Lap Chi LauHong Zhou

Journal:   Mathematical Programming Year: 2015 Vol: 154 (1-2)Pages: 515-532
BOOK-CHAPTER

Improved Algorithm for Degree Bounded Survivable Network Design Problem

Anand LouisNisheeth K. Vishnoi

Lecture notes in computer science Year: 2010 Pages: 408-419
© 2026 ScienceGate Book Chapters — All rights reserved.