IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v16y1970i8pb495-b508.html
   My bibliography  Save this article

Optimal Political Districting by Implicit Enumeration Techniques

Author

Listed:
  • R. S. Garfinkel

    (The University of Rochester)

  • G. L. Nemhauser

    (Center for Operations Research and Econometrics, University of Louvain, Belgium, Cornell University)

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.

Suggested Citation

  • R. S. Garfinkel & G. L. Nemhauser, 1970. "Optimal Political Districting by Implicit Enumeration Techniques," Management Science, INFORMS, vol. 16(8), pages 495-508, April.
    • Handle: RePEc:inm:ormnsc:v:16:y:1970:i:8:p:b495-b508
    DOI: 10.1287/mnsc.16.8.B495
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.16.8.B495
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.16.8.B495?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:16:y:1970:i:8:p:b495-b508. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.