Design of survivable networks with bounded rings /

This book studies the problem of designing, at minimal cost, a two-connected network such that each edge belongs to a cycle of bounded length. This problem arises in the long-term planning of telecommunications networks. The book provides an in-depth study of the underlying polyhedron, proposing sev...

Full description

Bibliographic Details
Main Author:	Fortz, Bernard
Corporate Author:	SpringerLink (Online service)
Format:	eBook
Language:	English
Published:	Dordrecht ; Boston : Kluwer Academic Publishers, [2000]
Series:	Network theory and applications ; volume 2.
Subjects:	Laser communication systems > Design and construction. Ring networks (Computer networks) Fault tolerance (Engineering) Computernetwerken. Telecommunicatie. Mathematische programmering. Fehlertoleranz. Ringnetz. Electronic books.
Online Access:	Connect to the full text of this electronic book

Table of Contents:

1. Introduction
2. Survivable Network Design: A Survey. 2.1. Notation and definitions. 2.2. Low-connectivity constrained network design problems. 2.3. Structural properties and particular cases. 2.4. Heuristics. 2.5. Polyhedral studies and exact algorithms
3. Two-connected Networks with Bounded Rings: The Model. 3.1. Motivation. 3.2. Mathematical formulations
4. Polyhedral Study. 4.1. Associated polytopes and trivial inequalities. 4.2. Cut constraints. 4.3. Node-cut and subset inequalities. 4.4. Ring-cut inequalities. 4.5. Ring-cover inequalities. 4.6. Metric inequalities. 4.7. Node-partition inequalities. 4.8. Weighted partition inequalities
5. The Special Case of Rings with Bounded Cardinality.