A note on the problem of \(r\) disjoint \((s, t)\)-cuts and some related issues

DOI10.1016/j.orl.2018.03.003OpenAlexW2790892121MaRDI QIDQ2417161

Walid Ben-Ameur, Mohamed Didi Biha

Publication date: 11 June 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2018.03.003

zbMATH Keywords

polyhedragraph partitioningcut

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Extended cuts
• A polynomial-time simplex method for the maximum \(k\)-flow problem
• Polyhedral proof methods in combinatorial optimization
• The ellipsoid method and its consequences in combinatorial optimization
• On the \(k\)-cut subgraph polytope
• On the dominant of the \(s\)-\(t\)-cut polytope: vertices, facets, and adjacency
• Disjoint (s, t)‐cuts in a network

This page was built for publication: A note on the problem of \(r\) disjoint \((s, t)\)-cuts and some related issues