Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Service Districting"”.

  1. Heuristic algorithms for districting problems

    In this thesis we study districting, a general class of optimization problem which asks for the grouping of small geographical units into disjoint clusters, called districts. Districting problems appear in a wide variety of applications, ranging from political districting for elections, to service …

    brazil-ufrgs Repository record for Heuristic algorithms for districting problems (opens in a new tab)

  2. Spatial Partitioning Algorithms for Solving Location-Allocation Problems

    … of this problem is to create contiguous service areas for the facilities such that the demand at all facilities is uniform or proportional to the available resources, while the distance between demand points and facilities is minimized. The results in this research are shown in the …

    unt Repository record for Spatial Partitioning Algorithms for Solving Location-Allocation Problems (opens in a new tab)