On the \(k\)-cut subgraph polytope
minimum-cost set of \(k\) pairwise-disjoint \((s,t)\)-cuts in a graph
scientific article; zbMATH DE number 700818