An Integer Polytope Related to the Design of Survivable Communication Networks

DOI10.1137/0406047MaRDI QIDQ4302271zbMATH OpenOpenAlexFDO

Authors Sylvia Boyd, Tianbao Hao

Publication date 14 August 1994

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0406047

zbMATH Keywords

communication networkconnected spanning subgraphcutting planesfacetsinteger polytopenetwork designpolyhedratotal edge cost

Mathematics Subject Classification ID

Connectivity (05C40) Combinatorial optimization (90C27)

Recommendations

• Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
• scientific article; zbMATH DE number 795223
• scientific article; zbMATH DE number 176255
• Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
• On survivable network polyhedra

Cited in

(8)

• On survivable network polyhedra
• The 2-edge-connected subgraph polyhedron
• Critical extreme points of the 2-edge connected spanning subgraph polytope
• Box-total dual integrality and edge-connectivity
• Facet generating techniques
• A branch-and-cut algorithm for the k-edge connected subgraph problem
• Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
• On the Steiner 2-edge connected subgraph polytope

This page was built for publication: An Integer Polytope Related to the Design of Survivable Communication Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302271)