An Optimization Based Heuristic for Political Districting

References

• Barnhart C., Johnson E. L., Nemhauser G. L., Savelsbergh M. W. P., Vance P. H. Branch-and-price: Column generation for huge integer programs. Oper. Res. (1998) . To appearGoogle Scholar
• Ferland J. A., Guénette G. Decision support system for a school districting problem. Oper. Res. (1990) 38:15–21Link, Google Scholar
• Fleischmann B., Paraschis J. N. Solving a large scale districting problem: A case report. Comput. Oper. Res. (1988) 15:521–533Crossref, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman and Company, New York) Google Scholar
• Garfinkel R. S., Nemhauser G. L. Optimal political districting by implicit enumeration techniques. Management Sci. (1970) 16:495–508Link, Google Scholar
• George J. A., Lamar B. W., Wallace C. A. Determining New Zealand electoral districts using a network-based model. Oper. Res. Soc. New Zealand, Proc. (1993) 29:276–283Google Scholar
• Kaiser H. An objective method for establishing legislative districts. Midwest J. Political Sci. (1966) . XGoogle Scholar
• Mehrotra A. Constrained graph partitioning: Decomposition, polyhedral structure and algorithms. (1992) . Ph.D. thesis, Georgia Institute of Technology, Atlanta, GAGoogle Scholar
• Mehrotra A., Johnson E., Nemhauser G. L. Taking the politics out of districting earlier version of the current paper. (1996) . Department of Management Science, School of Business Administration, University of Miami, Coral Gables, FLGoogle Scholar
• Mehrotra A., Trick M. A. A column generation approach for graph coloring. INFORMS J. Comput. (1996) 8:344–354Link, Google Scholar
• Mirchandani P. B., Francis R. L.Discrete Location Theory (1990) (John Wiley & Sons, Inc., New York) Google Scholar
• Nagel S. Simplified bipartisan computer redistricting. Stanford Law Rev. (1965) 17:863–899Crossref, Google Scholar
• Nemhauser G. L., Savelsbergh M. W. P., Sigismondi G. C. MINTO, a mixed integer optimizer. Oper. Res. Lett. (1994) 15:47–58Crossref, Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (John Wiley & Sons, Inc., New York) Crossref, Google Scholar
• Preimesberger J., Tarr D.Congressional Districts in the 1990s (1993) (Congressional Quarterly Inc., Library of Congress Cataloging-in-Publication Data, Washington, D.C) Google Scholar
• Ryan D. M., Foster B. A., Wren A. An integer programming approach to scheduling. Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling (1981) (North Holland, Amsterdam)269–280Google Scholar
• Slater C. M., Hall G. E.1993 County and City Extra (1992) (Bernan Press, Lanham, MD) Google Scholar
• Vance P. H., Barnhart C., Johnson E. L., Nemhauser G. L. Solving binary cutting stock problems by column generation and branch-and-bound. Comput. Optim. Appl. (1993) III:111–130Google Scholar
• Weaver J. B., Hess S. W. A procedure for nonpartisan districting: Development of computer techniques. Yale Law J. (1963) 73:288–308Crossref, Google Scholar
• Young H. P. Measuring the compactness of legislative districts. Legislative Stud. Quart. (1988) XIII:105–115Crossref, Google Scholar