Three main mathematical programming approaches have been followed to design exact algorithms for partitioning problems in cluster analysis, cutting-planes, branch-and-bound and recently, column generation combined with integer programming. These approaches are reviewed and evaluated, using two versions of the clique partitioning problem for illustration.