Redistricting to maximize the preservation of political boundaries
Author:
- 1 September 1983
- journal article
- Published by Elsevier in Social Science Research
- Vol. 12 (3) , 205-214
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Variations on a cutting plane method for solving concave minimization problems with linear constraintsNaval Research Logistics Quarterly, 1974
- Political Gerrymandering: A Statutory Compactness Standard as an Antidote for Judicial ImpotenceThe University of Chicago Law Review, 1974
- Optimal Political Districting by Implicit Enumeration TechniquesManagement Science, 1970
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme PointsOperations Research, 1970
- Solving the Fixed Charge Problem by Ranking the Extreme PointsOperations Research, 1968
- Hierarchical Clustering SchemesPsychometrika, 1967
- Simplified Bipartisan Computer RedistrictingStanford Law Review, 1965
- A Procedure for Nonpartisan Districting: Development of Computer TechniquesThe Yale Law Journal, 1963