On the 3-Terminal Cut Polyhedron

DOI10.1137/S0895480104445149zbMath1113.90128MaRDI QIDQ5470780

Mohamed Didi Biha

Publication date: 1 June 2006

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

zbMATH Keywords

polyhedron\(A\)-cut

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (1)

A branch-and-cut algorithm for the k-edge connected subgraph problem

This page was built for publication: On the 3-Terminal Cut Polyhedron