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' …

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 grou** 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 develo** …

We propose the use of variable resolution boundaries based on Central Voronoi
Tessellations (CVT) to spatially aggregate building exposure models for risk assessment to …

Every 10 years, when states are forced to redraw their congressional districts, the process is
intensely partisan, and the outcome is rarely fair and democratic. In the past few decades …

When constructing political districting plans, prominent criteria include population balance,
contiguity, and compactness. The compactness of a districting plan, which is often judged by …