Districting is the problem of grou** small geographic areas, called basic units, into larger
geographic clusters, called districts, such that the latter are balanced, contiguous, and …

Anticlustering refers to the process of partitioning elements into disjoint groups with the goal
of obtaining high between‐group similarity and high within‐group heterogeneity …

The problem of maximizing dispersion requires the selection of a specific number of
elements from a given set, in such a way that the minimum distance between the pairs of …

Most partitioning methods used in psychological research seek to produce homogeneous
groups (ie, groups with low intra‐group dissimilarity). However, there are also applications …

The paper presents a new mixed-integer programming formulation for the maximally diverse
grou** problem (MDGP) with attribute values. The MDGP is the problem of assigning …

In this paper, a maximum dispersion districting problem is considered that arises in the
collection of waste electric and electronic equipment. For a given geographic region, the …

We consider a resource allocation problem, referred to as the Maximum Diversity Problem
with Capacity and Budget Constraints. It involves establishing some facilities in such a way …

Facility dispersion problems involve placing a number of facilities as far apart from each
other as possible. Four different criteria of facility dispersal have been proposed in the …

This work focuses on the capacitated dispersion problem for which we study several
mathematical formulations in different spaces using variables associated with nodes, edges …

As a major type of continuous spatial queries, the moving nearest neighbor (NN) query has
been studied extensively. However, most existing studies have focused on only the query …