Back to search

Clemson University

Optimization Strategies for Political Redistricting

Abstract

dc:description.abstract

Political redistricting has remained a hot-button issue in the United States for several decades. Every ten years, most states need to redraw their districts to account for changing populations. Sometimes, these district plans can be drawn with the malevolent intention of aiding one political party over another. This dissertation summarizes four distinct methods of drawing these districts using computer algorithms while keeping several objectives in mind. We test these approaches on the case study state of South Carolina, since it provides a sufficiently challenging problem for us to test various algorithms. We find that many of these approaches improve upon the current South Carolina district map, and many of the algorithms improve upon or remain competitive with other redistricting procedures available in the literature.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy (PhD)
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Mathematical Sciences

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Splitter, Blake
Contributors dc:contributor
  • Matthew Saltzman
  • Mary E. Kurz
  • William Bridges
  • Neil Calkin

Subjects

dc:subject × 7

Identifiers

dc:identifier.*
Repository record dc:identifier
https://open.clemson.edu/all_dissertations/3727

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Splitter, Blake. Optimization Strategies for Political Redistricting. Dissertation thesis, https://open.clemson.edu/all_dissertations/3727