Abstract
The following basic clustering problem arises in different domains, ranging from physics, statistics and Boolean function minimization.
Given a graphG = (V, E) and edge weightsc e , 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.
Anequicut is a feasible solution of the above problem and theequicut polytope Q(G) is the convex hull of the incidence vectors of equicuts inG. In this paper we give some integer programming formulations of the equicut problem, study the dimension of the equicut polytope and describe some basic classes of facet-inducing inequalities forQ(G).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. Arbib, “A polynomial algorithm for line-graph partitioning,”Information Processing Letters 26 (1988) 223–230.
A. Bachem and M. Grötschel, “New aspects of polyhedral theory,” in: B. Korte, ed.,Modern Applied Mathematics — Optimization and Operations Research (North-Holland, Amsterdam, 1982) pp. 51–106.
F. Barahona, “A solvable case of quadratic 0–1 programming,”Discrete Applied Mathematics 13 (1986) 23–26.
F. Barahona and A. Casari, “On the magnetization of the ground states in two-dimensional Ising spin glasses,” Research Report, University of Waterloo (Waterloo, Ont., 1987).
F. Barahona, M. Grötschel, M. Jünger and G. Reinelt, “An application of combinatorial optimization to statistical physics and circuit layout design,”Operations Research 36 (1988) 493–513.
F. Barahona, M. Grötschel and A.R. Mahjoub, “Facets of the bipartite subgraph polytope,”Mathematics of Operations Research 10 (1985) 340–358.
F. Barahona and A.R. Mahjoub, “On the cut polytope,”Mathematical Programming 36 (1986) 157–173.
M. Conforti and M.R. Rao, “Some new matroids on graphs, cutsets and the max-cut problem,”Mathematics of Operations Research 12 (1987) 93–104.
J. Edmonds and D.R. Fulkerson, “Bottleneck extrema,”Journal of Combinatorial Theory 8 (1970) 299–306.
J. Edmonds and E.L. Johnson, “Matching, a well solved class of integer linear programs,” in: R. Guy, H. Hanani, N. Sauer and J. Schöneim, eds.,Combinatorial Structures and their Applications (Gordon and Breach, New York, 1970) pp. 89–92.
D.R. Fulkerson, “Blocking polyhedra,” in: B. Harris, ed.,Graph Theory and its Applications (Academic Press, New York, 1970) pp. 303–334.
B.W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,”Bell Systems Technical Journal 49(2) (1970) 291–307.
W. Pulleyblank, Private communication (1987).
Author information
Authors and Affiliations
Additional information
Partial support of NSF grants DMS 8606188 and ECS 8800281.
This work was done while these two authors visited IASI, Rome, in Spring 1987.
Rights and permissions
About this article
Cite this article
Conforti, M., Rao, M.R. & Sassano, A. The equipartition polytope. I: Formulations, dimension and basic facets. Mathematical Programming 49, 49–70 (1990). https://doi.org/10.1007/BF01588778
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01588778