The classical p-median problem assumes that service to customers is always provided by the closest facility, while in practice, customers often interact for...

The maximally diverse grouping problem requires finding a partition of a given set of elements into a fixed number of mutually disjoint subsets (or groups) i...

In this paper we show that the Clique Partitioning Problem can be reformulated in an equivalent form as the Maximally Diverse Grouping Problem (MDGP). We th...