Small Min-Cut Polyhedra
Published Online:1 Feb 1999https://doi.org/10.1287/moor.24.1.35
Abstract
We study small min-cut polyhedra for directed and undirected complete graphs. We give the ideal descriptions of the polyhedra for undirected graphs with up to seven nodes and for directed graphs with up to five nodes, and generalize the inequalities for complete graphs with arbitrary number of nodes. The facial structure of the polyhedra turns out to be unexpectedly rich.
