An Exact Solution Method for the Political Districting Problem
From MaRDI portal
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
Cites work
- A strong formulation for the graph partition problem
- Aggregation and Disaggregation in Integer Programming Problems
- An optimization based heuristic for political districting
- Extended Graph Formulation for the Inequity Aversion Pricing Problem on Social Networks
- Optimal Political Districting by Implicit Enumeration Techniques
- Political districting: from classical models to recent approaches
- The convex recoloring problem: polyhedra, facets and computational experiments
Cited in
(8)- Imposing contiguity constraints in political districting models
- Political districting: From classical models to recent approaches
- A new integer linear programming formulation for the problem of political districting
- Axiomatic districting
- Political districting: from classical models to recent approaches
- Solving the segmentation problem for the 2010 argentine census with integer programming
- Optimal political districting
- Political districting to minimize cut edges
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)
