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 …

Abstract The Set Covering Problem (SCP) is one of the classical Karp's 21 NP-complete
problems. Although this is a traditional optimization problem, we find many papers assuming …

The problem of grouping basic units into larger geographic territories subject to dispersion,
connectivity, and balance requirements is addressed. The problem is motivated by a real …

A districting problem consisting of the minimization of a dispersion function subject to
multiple-activity balancing and contiguity constraints is addressed. This problem arises from …

Geographical areas have diverse green energy resources and different levels of energy
consumptions. An important challenge to satisfy the energy demand using green energy …

Partitioning a large network into multiple subnetworks is adopted extensively in various
practical applications involving the architecture of distributed management. In this study, we …

Territory design deals with the discrete assignment of geographical units into territories with
restrictions defined by planning criteria. We propose an exact solution method based on an …

In this document, we present a covering problem where vertices of a graph have to be
covered by rooted subtrees. We present three mixed-integer linear programming models …

In this article, we present an empirical evaluation of a metaheuristic approach to a
commercial districting problem. The problem consists of partitioning a given set of basic …