An Integer Polytope Related to the Design of Survivable Communication Networks

DOI10.1137/0406047zbMath0803.05037OpenAlexW2050851587MaRDI QIDQ4302271

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

polyhedracutting planesnetwork designcommunication networkfacetsconnected spanning subgraphinteger polytopetotal edge cost

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Connectivity (05C40)

Related Items (7)

Box-total dual integrality and edge-connectivity ⋮ Facet Generating Techniques ⋮ On survivable network polyhedra ⋮ On the Steiner 2-edge connected subgraph polytope ⋮ A branch-and-cut algorithm for the k-edge connected subgraph problem ⋮ The 2-edge-connected subgraph polyhedron ⋮ Critical extreme points of the 2-edge connected spanning subgraph polytope

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