scientific article; zbMATH DE number 1342128

zbMath0948.90140MaRDI QIDQ4263710

Jean Fonlupt, Ali Ridha Mahjoub

Publication date: 22 September 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polytopecut2-edge connected graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Design of Survivable Networks: A survey, The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points., On the dominant of the Steiner 2-edge connected subgraph polytope, On the Steiner 2-edge connected subgraph polytope, The 2-edge-connected subgraph polyhedron, Separation of partition inequalities for the \((1,2)\)-survivable network design problem