Computational geometric approaches to equitable districting: a survey

DOI10.1007/978-3-030-34312-5_4MaRDI QIDQ1980463zbMATH OpenOpenAlexFDO

Authors Mehdi Behroozi, John Gunnar Carlsson

Publication date 8 September 2021

Full work available at URL https://doi.org/10.1007/978-3-030-34312-5_4

zbMATH Keywords

computational geometryconvex partitiondiscrete geometrydistrictingequitable partitionham sandwichpower diagramVoronoi diagram

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Discrete location and assignment (90B80)

Recommendations

• A computational approach to unbiased districting
• A geometric approach to fair division
• Optimal partisan districting on planar geographies
• Approximation schemes for districting problems with probabilistic constraints
• scientific article; zbMATH DE number 2153479
• Mathematical programming formulations for practical political districting
• scientific article; zbMATH DE number 3974683
• Equitable subdivisions within polygonal regions
• Algorithms for fair partitioning of convex polygons

Cited in

(8)

• Research trends in optimization of districting systems
• School redistricting: embedding GIS tools with integer programming
• Preprocessing for a map sectorization problem by means of mathematical programming
• Optimal districting and territory design
• Tabu search with strategic oscillation for improving collection assignment plans of waste electric and electronic equipment
• 3D geo-graphs: efficient flip verification for the spherical zoning problem
• A multi-criteria districting approach with a lexicographic compactness metric: an application to the Chilean postal service
• A fair division solution to the problem of redistricting

This page was built for publication: Computational geometric approaches to equitable districting: a survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1980463)