JOURNAL ARTICLE

An Exact Solution Method for the Political Districting Problem.

  • Published In: Parallel Processing Letters, 2023, v. 33, n. 1/2. P. 1 1 of 3

  • Database: Academic Search Ultimate 2 of 3

  • Authored By: Chopra, Sunil; Park, Hyunwoo; Shim, Sangho 3 of 3

Abstract

Mehrotra, Johnson, and Nemhauser (1998) [Management Science 44, pp. 1100–1114] addressed a problem for political districting and developed an optimization based heuristic to find good districting plans which partition the population units into contiguous districts with equal populations. Their case study found a good South Carolina plan at a penalty cost of 68. This paper develops a strong integer programming model identifying the exact optimal solution. Our model identifies the optimal South Carolina plan at the minimum penalty of 64. Motivated by the 2019 lawsuit challenging the congressional plan as gerrymandering, we inspect the actual Maryland plan. [ABSTRACT FROM AUTHOR]

Additional Information

  • Source:Parallel Processing Letters. 2023/03, Vol. 33, Issue 1/2, p1
  • Document Type:Article
  • Subject Area:Political Science
  • Publication Date:2023
  • ISSN:0129-6264
  • DOI:10.1142/S0129626423400017
  • Accession Number:163910134
  • Copyright Statement:Copyright of Parallel Processing Letters is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Looking to go deeper into this topic? Look for more articles on EBSCOhost.