We describe a decomposition framework and a column generation scheme f
or solving a min-cut clustering problem. The subproblem to generate ad
ditional columns is itself an NP-hard mixed integer programming proble
m. We discuss strong valid inequalities for the subproblem and describ
e some efficient solution strategies. Computational results on compile
r construction problems are reported.