Design of survivable networks

DOI10.1007/BFb0088963zbMath0766.90063OpenAlexW1541536235MaRDI QIDQ1202193

Mechthild Stoer

Publication date: 23 January 1993

Published in: Lecture Notes in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0088963

zbMATH Keywords

valid inequalitiespolyhedral combinatorics\(k\)-connected networksdesign of survivable networks

Mathematics Subject Classification ID

Integer programming (90C10) Communication networks in operations research (90B18) Combinatorial optimization (90C27)

Related Items (31)

Optimal capacitated ring trees ⋮ Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron ⋮ Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice ⋮ Some recent contributions to network optimization ⋮ A branch-and-cut algorithm for two-level survivable network design problems ⋮ Finding Totally Independent Spanning Trees with Linear Integer Programming ⋮ Design of survivable IP-over-optical networks ⋮ Design of Survivable Networks: A survey ⋮ On the reliability estimation of stochastic binary systems ⋮ A polyhedral approach to planar augmentation and related problems ⋮ Survivable network design with demand uncertainty ⋮ Survivability in Hierarchical Telecommunications Networks Under Dual Homing ⋮ A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints ⋮ A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees ⋮ An approximation algorithm for minimum-cost vertex-connectivity problems ⋮ Stochastic survivable network design problems: theory and practice ⋮ Strong formulations for network design problems with connectivity requirements ⋮ On survivable network polyhedra ⋮ Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems ⋮ On the dominant of the Steiner 2-edge connected subgraph polytope ⋮ Steiner trees and polyhedra ⋮ The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation ⋮ VNS and second order heuristics for the min-degree constrained minimum spanning tree problem ⋮ The capacitated m two node survivable star problem ⋮ A formulation for a hop constrained survivable network design problem ⋮ Hop-constrained node survivable network design: An application to MPLS over WDM ⋮ Strong Formulations for 2-Node-Connected Steiner Network Problems ⋮ New modeling approaches for the design of local access transport area networks ⋮ Critical extreme points of the 2-edge connected spanning subgraph polytope ⋮ On the Generalized Steiner Problem with Network Reliability Conditions ⋮ Separation of partition inequalities for the \((1,2)\)-survivable network design problem

This page was built for publication: Design of survivable networks