A strengthened mixed-integer linear formulation for the K clusters problem with fixed cardinality

In this paper we study the K clusters with fixed cardinality problem that consists in finding K clusters, where each cluster has a fixed cardinality. We propose a mixed-integer linear programming formulation and deduce valid inequalities to strengthen the linear relaxation bound. The quality of the model is tested on randomly generated instances, by using standard software, with promising results.