Optimal Political Districting by Implicit Enumeration Techniques

R. S. Garfinkel and G. L. Nemhauser
Additional contact information
R. S. Garfinkel: The University of Rochester
G. L. Nemhauser: Center for Operations Research and Econometrics, University of Louvain, Belgium, Cornell University

Management Science, 1970, vol. 16, issue 8, B495-B508

Abstract: An algorithm is given which finds all optimal solutions, for a given set of criteria, to political redistricting problems. Using "population units" as indivisible elements, the first phase generates all feasible districts, where feasibility indicates contiguity, compactness and limited population deviation. The second phase finds that set of M feasible districts which "covers" each population unit exactly once, and minimizes the maximum deviation of any district population from the mean district population. Computational results indicate that states with 40 counties or fewer can be solved in less than 10 minutes on an IBM 7094. However, our attempt to solve a 55 county state was unsuccessful.

Date: 1970
References: Add references at CitEc
Citations: View citations in EconPapers (46)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.16.8.B495 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:16:y:1970:i:8:p:b495-b508

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().