Comparing voting districts with uncertain data envelopment analysis

DOI10.1007/S11590-023-02046-0MaRDI QIDQ6968862zbMATH OpenFDO

Authors Allen G. Holder, Casey Garner

Publication date 23 June 2025

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11590-023-02046-0

zbMATH Keywords

gerrymanderingdata envelopment analysisrobust optimization

Mathematics Subject Classification ID

Operations research and management science (90Bxx) Graph theory (05Cxx) Mathematical programming (90Cxx)

Cites work

• scientific article; zbMATH DE number 5080888 (Why is no real title available?)
• A simulated annealing approach to police district design
• A tabu search heuristic and adaptive memory procedure for political districting
• Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
• Geo-graphs: an efficient model for enforcing contiguity and hole constraints in planar graph partitioning
• Political districting: from classical models to recent approaches
• Pyomo -- optimization modeling in Python
• School redistricting: embedding GIS tools with integer programming
• The geo-graph in practice: creating United States congressional districts from census blocks
• Uncertain data envelopment analysis

Cited in

(1)

• Classifying with uncertain data envelopment analysis

This page was built for publication: Comparing voting districts with uncertain data envelopment analysis

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