A new integer linear programming formulation for the problem of political districting

DOI10.1007/S10479-020-03559-YzbMath1441.90098OpenAlexW3010603604MaRDI QIDQ2173126

Zoran Maksimović, Djordje Dugošija, Aleksandar Savić

Publication date: 22 April 2020

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-020-03559-y

zbMATH Keywords

combinatorial optimizationgraph partitioninginteger linear programmingpolitical districting

Mathematics Subject Classification ID

Mixed integer programming (90C11) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) History, political science (91F10)

Related Items (3)

Modularity maximization to design contiguous policy zones for pandemic response ⋮ Constraint-based electoral districting using a new compactness measure: an application to Portugal ⋮ Approximation schemes for districting problems with probabilistic constraints

Uses Software

• CPLEX

Cites Work

• Preprocessing for a map sectorization problem by means of mathematical programming
• The geometry of optimal partitions in location problems
• Optimal political districting
• A tabu search heuristic and adaptive memory procedure for political districting
• Weighted Voronoi region algorithms for political districting
• Political districting: from classical models to recent approaches
• Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
• An Optimization Based Heuristic for Political Districting
• Evaluation and Optimization of Electoral Systems
• Optimal Political Districting by Implicit Enumeration Techniques

This page was built for publication: A new integer linear programming formulation for the problem of political districting