On survivable network polyhedra
type: Item
instance of: scholarly article
title: On survivable network polyhedra
zbMATH Open document ID: 1079.90022
author: Hervé L. M. Kerivin
author: A. R. Mahjoub
published in: Discrete Mathematics
publication date: 2005-04-18T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 2157731
zbMATH Keywords: Survivable network
zbMATH Keywords: Polyhedron
zbMATH Keywords: Cut
zbMATH Keywords: Series-parallel graph
zbMATH Keywords: Polynomial algorithm
MaRDI profile type: Publication
full work available at URL: j.disc.2004.08.017
OpenAlex ID: W1965140003
cites work: Q3128882
cites work: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
cites work: On the dominant of the Steiner 2-edge connected subgraph polytope
cites work: Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs
cites work: On two-connected subgraph polytopes
cites work: An Integer Polytope Related to the Design of Survivable Communication Networks
cites work: The k-Edge-Connected Spanning Subgraph Polyhedron
cites work: The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
cites work: The Steiner tree problem. II: Properties and classes of facets
cites work: The traveling salesman problem on a graph and some related integer polyhedra
cites work: The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs
cites work: Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs
cites work: Steiner trees and polyhedra
cites work: \(k\)-edge connected polyhedra on series-parallel graphs
cites work: Steiner \(k\)-edge connected subgraph polyhedra
cites work: Q5624995
cites work: Topology of series-parallel networks
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: An efficient approximation algorithm for the survivable network design problem
cites work: The Steiner tree polytope and related polyhedra
cites work: Survivable networks, linear programming relaxations and the parsimonious property
cites work: Q3128880
cites work: Q4763416
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
cites work: Q4035361
cites work: Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
cites work: Q4845372
cites work: A factor 2 approximation algorithm for the generalized Steiner network problem
cites work: Q5465113
cites work: Two-edge connected spanning subgraphs and polyhedra
cites work: Tree polytope on 2-trees
cites work: Design of survivable networks
cites work: A primal-dual approximation algorithm for generalized Steiner network problems
cites work: Generalized Steiner problem in outerplanar networks
cites work: Generalized steiner problem in series-parallel networks
DOI: 10.1016/J.DISC.2004.08.017
Recommended article: Q4035361
Recommended article: Q5294055
Recommended article: On the Polytope of the (1,2)-Survivable Network Design Problem
Recommended article: A polyhedral approach to multicommodity survivable network design
Recommended article: An Integer Polytope Related to the Design of Survivable Communication Networks
Recommended article: Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
Recommended article: Two node-disjoint hop-constrained survivable network design and polyhedra
Recommended article: More facets for survivable networks
Recommended article: Q4353134
Recommended article: Design of survivable networks
description: scientific article; zbMATH DE number 2157731