The equipartition polytope. II: Valid inequalities and facets

The equipartition problem is defined as follows: given a graph G=(V, e) and edge weigths ce, partition the set V into two sets of and nodes in such a way that the sum of the weights of edges not having both endnodes in the same set is maximized or minimized. An equicut is a feasible solution of the above problem and the equicut polytope is the convex hull of the incidence vectors of equicuts in G. In this paper the authors describe some facet inducing inequalities of this polytope.