Min-cut clustering

We describe a decomposition framework and a column generation scheme for solving a min-cut clustering problem. The subproblem to generate additional columns is itself an NP-hard mixed integer programming problem. We discuss strong valid inequalities for the subproblem and describe some efficient solution strategies. Computational results on compiler construction problems are reported.

[1]  Martin Grötschel,et al.  Facets of the clique partitioning polytope , 1990, Math. Program..

[2]  Sungsoo Park,et al.  A polyhedral approach to edge coloring , 1991, Oper. Res. Lett..

[3]  Mihalis Yannakakis,et al.  The complexity of multiway cuts (extended abstract) , 1992, STOC '92.

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Ellis L. Johnson.  Modelling and strong linear programs for mixed integer programming , 1989 .

[6]  Antonio Sassano,et al.  The equipartition polytope. I: Formulations, dimension and basic facets , 1990, Math. Program..

[7]  Antonio Sassano,et al.  The equipartition polytope. II: Valid inequalities and facets , 1990, Math. Program..

[8]  M. R. Rao,et al.  The partition problem , 1993, Math. Program..

[9]  Sunil Chopra,et al.  The Graph Partitioning Polytope on Series-Parallel and4-Wheel Free Graphs , 1994, SIAM J. Discret. Math..

[10]  Yoshiko Wakabayashi,et al.  A cutting plane algorithm for a clustering problem , 1989, Math. Program..

[11]  Manfred W. Padberg,et al.  The boolean quadric polytope: Some characteristics, facets and relatives , 1989, Math. Program..

[12]  Ali Ridha Mahjoub,et al.  On the cut polytope , 1986, Math. Program..

[13]  Dorit S. Hochbaum,et al.  Polynomial algorithm for the k-cut problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[14]  Anuj Mehrotra.  Constrained graph partitioning: decomposition, polyhedral structure and algorithms , 1992 .

[15]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .