Abstract The Political Districting problem has been studied since the 60's and many different
models and techniques have been proposed with the aim of preventing districts' …

In this paper, we introduce a new spatially constrained clustering problem called the max‐p‐
regions problem. It involves the clustering of a set of geographic areas into the maximum …

For several years, parts of the content of this textbook have been used in undergraduate
courses in the Department of Mathematics and in the Faculty of Economics at the University …

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

While graph covering is a fundamental and well-studied problem, this field lacks a broad
and unified literature review. The holistic overview of graph covering given in this article …

Beginning in the 1960s, techniques from operations research began to be used to generate
political districting plans. A classical example is the integer programming model of Hess et …

The American winner-take-all congressional district system empowers politicians to
engineer electoral outcomes by manipulating district boundaries. Existing computational …

Motivated by a proposal of the local authority for improving the existing healthcare system in
the Parana State in Brazil, this article presents an optimization-based model for developing …

Since the 1960's, computers have been regularly promoted as both the salvation of
redistricting and as a strong corrupting force. On the one hand, computing has been …

This study considers a multi-objective dynamic stochastic districting and routing problem in
which the customers of a territory stochastically evolve over several periods of a planning …