An Exact Solution Method for the Political Districting Problem
From MaRDI portal
Publication:6135729
DOI10.1142/S0129626423400017zbMATH Open1518.91212OpenAlexW4307514373MaRDI QIDQ6135729FDOQ6135729
Authors: Sunil Chopra, Hyun Woo Park, Sangho Shim 
Publication date: 26 August 2023
Published in: Parallel Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129626423400017
Recommendations
- Mathematical programming formulations for practical political districting
- A new integer linear programming formulation for the problem of political districting
- Optimal political districting
- A computational approach to unbiased districting
- Local search algorithms for political districting
- Political districting: From classical models to recent approaches
- Political districting: from classical models to recent approaches
- Optimal partisan districting on planar geographies
- A generalized parametric divisor method for political apportionment
- A sample approximation solution procedure for chance-constrained districting problems
optimizationgerrymanderinginteger programmingpolitical districtingcity planningmanagement science of democracyrelational gerrymander score
Cites Work
- An optimization based heuristic for political districting
- The convex recoloring problem: polyhedra, facets and computational experiments
- Political districting: from classical models to recent approaches
- Optimal Political Districting by Implicit Enumeration Techniques
- Aggregation and Disaggregation in Integer Programming Problems
- A strong formulation for the graph partition problem
- Extended Graph Formulation for the Inequity Aversion Pricing Problem on Social Networks
Cited In (3)
This page was built for publication: An Exact Solution Method for the Political Districting Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135729)
