Optimal Political Districting by Implicit Enumeration Techniques
From MaRDI portal
Publication:5591291
DOI10.1287/MNSC.16.8.B495zbMath0195.22103OpenAlexW1978828094MaRDI QIDQ5591291
Nemhauser, George I., Robert Garfinkel
Publication date: 1970
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.16.8.b495
Related Items (59)
Constraint programming and operations research ⋮ A note on equity across groups in facility location ⋮ Redistricting algorithms ⋮ System model and performance estimation of dynamic spectrum allocation strategy with multi-channel and imperfect sensing ⋮ An overview of graph covering and partitioning ⋮ Optimal partisan districting on planar geographies ⋮ Optimal political districting ⋮ A redistricting problem applied to meter reading in power distribution networks ⋮ A computational approach to unbiased districting ⋮ Achieving full connectivity of sites in the multiperiod reserve network design problem ⋮ Aggregation of constraints in integer programming ⋮ Voronoi diagrams with overlapping regions ⋮ Political districting: from classical models to recent approaches ⋮ Solving a large scale districting problem: A case report ⋮ Imposing Contiguity Constraints in Political Districting Models ⋮ A binary cat swarm optimization algorithm for the non-unicost set covering problem ⋮ Modularity maximization to design contiguous policy zones for pandemic response ⋮ A new integer linear programming formulation for the problem of political districting ⋮ Goal programming approach for political districting in Santa Catarina state: Brazil ⋮ A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution ⋮ An optimization-based approach for the healthcare districting under uncertainty ⋮ On imposing connectivity constraints in integer programs ⋮ The coastal seaspace patrol sector design and allocation problem ⋮ Constraint-based electoral districting using a new compactness measure: an application to Portugal ⋮ Optimal connected subgraphs: Integer programming formulations and polyhedra ⋮ Redistricting optimization with recombination: a local search case study ⋮ STATISTICAL PHYSICS APPROACH TO POLITICAL DISTRICTING PROBLEM ⋮ New models for commercial territory design ⋮ Set partitioning mit linearen Randbedingungen ⋮ An Exact Solution Method for the Political Districting Problem ⋮ A generalized bottleneck assignment problem ⋮ Vertex covering with capacitated trees ⋮ Linear-size formulations for connected planar graph partitioning and political districting ⋮ A districting procedure for social organizations ⋮ An effective structured approach to finding optimal partitions of networks ⋮ Political districting: From classical models to recent approaches ⋮ Preprocessing for a map sectorization problem by means of mathematical programming ⋮ Multiple criteria districting problemsthe public transportation network pricing system of the Paris region ⋮ Enhancing an algorithm for set covering problems ⋮ A reactive GRASP for a commercial territory design problem with multiple balancing requirements ⋮ An integer programming approach to generating airline crew pairings ⋮ Modeling and algorithmic development of a staff scheduling problem ⋮ Bottleneck linear programming ⋮ Local search algorithms for political districting ⋮ Hooked on IP ⋮ A dual bounding scheme for a territory design problem ⋮ A multi-objective districting problem applied to agricultural machinery maintenance service network ⋮ A simulated annealing approach to police district design ⋮ Die Anwendung der Dynamischen Optimierung bei der Sozial-Sanitären Bezirkseinteilung ⋮ Optimal location with equitable loads ⋮ Solving the segmentation problem for the 2010 Argentine census with integer programming ⋮ Service allocation equity in location coverage analytics ⋮ Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder) ⋮ The stochastic bottleneck linear programming problem ⋮ Political districting to minimize cut edges ⋮ Algorithms for large scale set covering problems ⋮ An extension of set partitioning with application to scheduling problems ⋮ Districting for salt spreading operations ⋮ A tabu search heuristic and adaptive memory procedure for political districting
This page was built for publication: Optimal Political Districting by Implicit Enumeration Techniques
