Given a graph G = V,E and a set N ⊆ V, we consider the problem of finding a minimum‐weight multiway cut that separates each pair of nodes in N. In this paper we give an integer programming formulation of this problem and study the associated polyhedron. We give some computational results to support the strength of our facets. We also give some efficiently solvable instances.
ASJC Scopus subject areas
- Information Systems
- Hardware and Architecture
- Computer Networks and Communications