The problem of maximizing diversity or dispersion deals with selecting a subset of elements
from a given set in such a way that the distance among the selected elements is maximized …

Given a weighted graph with a capacity associated to each node (element), the capacitated
dispersion problem (CDP) consists in selecting a subset of elements satisfying a capacity …

The topic of this paper is the Capacitated Dispersion Problem (CDP). To solve the problem,
variable neighborhood search (VNS) based heuristics are proposed. The proposed …

The challenge of maximizing the diversity of a collection of points arises in a variety of
settings, and the growing interest of dealing with diversity resulted in an effort to study these …

The capacitated dispersion problem is a variant of the maximum diversity problem in which a
set of elements in a network must be determined. These elements might represent, for …

The capacitated dispersion problem, which is a variant of the maximum diversity problem,
aims to determine a set of elements within a network. These elements could symbolize, for …

The maximum diversity, or dispersion, problem (MDP), is to select from a given set a subset
of elements of given cardinality (budget), so that the sum of pairwise distances, or utilities …

This paper studies binary quadratic programs in which the objective is defined by the
maximisation of a Euclidean distance matrix, subject to a general polyhedral constraint set …

We propose a novel Multi-Neighborhood Simulated Annealing approach to address the
Capacitated Dispersion Problem. It makes use of three neighborhoods, adapted from similar …

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