Solving the maximally diverse grouping problem by skewed general variable neighborhood search

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) in order to maximize the overall diversit...