On Some Variants for Anticlustering

Abstract

Anticlustering is the partitioning objects into groups such that intergroup similarity and intra-(breakpoint)group heterogeneity are high. In this report, we propose several optimization problems for anticlustering, and show the results obtained from a heuristic of the proposed problems.