Analysis of integer programming formulations of clustering problems

摘要

Five different integer programming formulations of the clustering problem are discussed. Three new heuristic algorithms for solving these problems are presented. Some of the existing algorithms are generalized. The relevance of integer programming and combinatorial theory to cluster analysis is discussed. Many other applicable algorithms are listed.