Min-Cut Clustering Problem Instances

Files *.out contain instances of the Min-Cut Clustering problem contributed by C.E. Ferreira, see E.L. Johnson, A. Mehrota, G.L. Nemhauser: Min-Cut Clustering, School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, 1992, for more information and C.E.  Ferreira, A  Martin, C.C. de Souza, R. Weismantel, L.A. Wolsey, The Node Capacitated Graph Partitioning Problem: A Computational Study, CORE Discussion Paper 9453, Universite Catholique de Louvain, Louvain-la-Neuve, for information on computational results.

Info  -  Description of data format

cb450.30.6.47.out  -  6 clusters, 450 objects
cb450.45.8.98.out  -  15 clusters, 450 objects
cb450.47.8.99.out  -  16 clusters, 450 objects
cb450.47.9.101.out  - 18 clusters, 450 objects
cb450.61.9.187.out  -  17 clusters, 450 objects
cb512.30.5.47.out  -  10 clusters, 512 objects
cb512.45.7.98.out  -  13 clusters, 512 objects
cb512.47.7.99.out  -  14 clusters, 512 objects
cb512.47.8.101.out  -  16 clusters, 512 objects
cb512.61.8.187.out  -  15 clusters, 512 objects