The equipartition polytope. II: Valid inequalities and facets (original) (raw)

Mathematical Programming, 1991

Michele Conforti

Abstract

Theequipartition problem is defined as follows: given a graphG = (V, E) and edge weightsce, partition the setV into two sets of ?1/2|V|? and ?1/2|V|? 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.

Michele Conforti hasn't uploaded this paper.

Create a free Academia account to let Michele know you want this paper to be uploaded.

Ask for this paper to be uploaded.