On the Polytope of the (1,2)-Survivable Network Design Problem

DOI10.1137/050639600zbMath1192.68025OpenAlexW2048117285MaRDI QIDQ3648517

Mohamed Didi Biha, Hervé L. M. Kerivin, Ali Ridha Mahjoub

Publication date: 27 November 2009

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

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

zbMATH Keywords

polytopefacetseries-parallel graphssurvivable networkcut and partition inequalities

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Network design and communication in computer systems (68M10)

Related Items (2)

Separation of partition inequalities with terminals ⋮ Critical extreme points of the 2-edge connected spanning subgraph polytope

This page was built for publication: On the Polytope of the (1,2)-Survivable Network Design Problem