Article ID Journal Published Year Pages File Type
7543826 Operations Research Letters 2018 5 Pages PDF
Abstract
In this paper we consider the problem of finding a minimum-cost set of r disjoint (s,t)-cuts. We establish the link between this problem and some of its variations. We give a full description of the dominant of the convex hull of the incidence vectors of sets of r disjoint (s,t)-cuts. This generalizes the well-known result for the r=1 case.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A note on the problem of r disjoint (s,t)-cuts and some related issues
Authors
, ,