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 4 of 4 for “"Political Redistricting"”.

  1. Optimization methods for political redistricting

    Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2026-08-01

    uiuc Repository record for Optimization methods for political redistricting (opens in a new tab)

  2. High-performance evolutionary computation for scalable spatial optimization

    … This framework is employed to solve large political redistricting problems. Voting district-level redistricting problems are solved and sampled to create billions of feasible districting plans that adhere to Supreme Court mandates, suitable for statistical analyses of redistricting

    uiuc Repository record for High-performance evolutionary computation for scalable spatial optimization (opens in a new tab)

  3. Graph partitioning: redistricting games and the spherical zoning problem

    Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2025-08-01

    uiuc Repository record for Graph partitioning: redistricting games and the spherical zoning problem (opens in a new tab)

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