On the dominant of the \(s\)-\(t\)-cut polytope: vertices, facets, and adjacency

DOI10.1007/s10107-010-0373-7zbMath1198.90290OpenAlexW2098075313MaRDI QIDQ2638384

Martin Skutella, Alexia Weber

Publication date: 16 September 2010

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-010-0373-7

zbMATH Keywords

flowspolyhedral combinatoricscuts

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (4)

On the directed cut cone and polytope ⋮ A note on the problem of \(r\) disjoint \((s, t)\)-cuts and some related issues ⋮ The st-bond polytope on series-parallel graphs ⋮ On graphs of the cone decompositions for the min-cut and max-cut problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the cut polyhedron.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts
• Small Min-Cut Polyhedra
• A Suggested Computation for Maximal Multi-Commodity Network Flows
• Maximal Flow Through a Network
• Blocking and anti-blocking pairs of polyhedra

This page was built for publication: On the dominant of the \(s\)-\(t\)-cut polytope: vertices, facets, and adjacency