Cluster Analysis is at the crossroad of many disciplines, and has numerous and diverse methods and applications. Mathematical Programming (together with graph theory, complexity theory and data structures) can be used to give a coherent view of the field. This leads to define clustering paradigms, specify problems within these paradigms as mathematical programs, study their complexity, design polynomial algorithms for easy problems, non polynomial ones or heuristics for hard ones and evaluate results obtained. An overview of this line of research is given, stressing exact algorithms.
Paru en juin 1995 , 23 pages
Ce cahier a été révisé en août 1995