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 6 of 6 for “"Political Districting"”.

  1. Optimal political districting: an interactive computer graphics system

    … is developed for application to the solution of political districting problems. The foundation for the system is a previously developed two phase algorithm which finds all optimal solutions, for a given set of criteria, to the districting problem. The first phase generates all feasible districts …

    ut-knoxville Repository record for Optimal political districting: an interactive computer graphics system (opens in a new tab)

  2. Optimization approaches for political districting and graph partitioning

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-03-01 without embargo terms

    uiuc Repository record for Optimization approaches for political districting and graph partitioning (opens in a new tab)

  3. Embeddings for Disjunctive Programs with Applications to Political Districting and Rectangle Packing

    … knapsack which is inspired by a simplified political districting problem. We present and derive a constant time solution to the problem via a reduced-dimensional reformulation, the Karash-Kuhn-Tucker optimality conditions, and gradient descent. The second chapter covers a more complete form …

    vt Repository record for Embeddings for Disjunctive Programs with Applications to Political Districting and Rectangle Packing (opens in a new tab)

  4. Graph theory models and algorithms for political districting: an approach to inform public policy

    Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2012-04-11T20:25:12Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 King_Douglas.pdf: 1375871 bytes, checksum: 8a2dc282ca0fa7b95c1cf6905c139609 (MD5)

    uiuc Repository record for Graph theory models and algorithms for political districting: an approach to inform public policy (opens in a new tab)

  5. A mathematical model for political districting with compactness consideration and an application to Kentucky Senate districting

    The basic redistricting problem is defined as aggregating a set of base (indivisible) units into contiguous geographical areas with almost equal voter population, called districts, and districts into a district plan. The method used to create districts can have a substantial impact on election …

    uiuc Repository record for A mathematical model for political districting with compactness consideration and an application to Kentucky Senate districting (opens in a new tab)

  6. 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)