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 …

Counterfactual Analysis has shown to be a powerful tool in the burgeoning field of
Explainable Artificial Intelligence. In Supervised Classification, this means associating with …

Vehicular ad hoc networks (VANETs) are a fundamental component of intelligent
transportation systems in smart cities. With the support of open and real-time data, these …

Abstract The Quadratic Knapsack Problem (QKP) involves selecting a subset of elements
that maximizes the sum of pairwise and singleton utilities without exceeding a given budget …

Diversity and dispersion problems deal with selecting a subset of elements from a given set
in such a way that their diversity is maximized. This study considers a practical location …

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 Euclidean max-sum diversity problem becomes substantially more difficult as the
number of coordinates increases despite the number of decision variables not changing. In …

Numerous studies have examined classroom seating arrangements to enhance student
safety and resource utilization during COVID-19. These studies typically aimed to maximize …

This paper aims to answer an open question recently posed in the literature, that is to find a
fast exact method for solving the max-sum diversity problem, a nonconcave quadratic binary …

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 …