An Optimization Based Heuristic for Political Districting
From MaRDI portal
Publication:2784017
DOI10.1287/mnsc.44.8.1100zbMath0988.90542OpenAlexW2141505357MaRDI QIDQ2784017
Nemhauser, George I., Anuj Mehrotra, Ellis L. Johnson
Publication date: 8 July 2002
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.44.8.1100
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Operations research and management science (90B99)
Related Items
A note on equity across groups in facility location, Algorithms for gerrymandering over graphs, Redistricting algorithms, An overview of graph covering and partitioning, A multi-criteria police districting problem for the efficient and effective design of patrol sector, Optimal partisan districting on planar geographies, A mini–max spanning forest approach to the political districting problem, Dynamic design of sales territories, A computational approach to unbiased districting, Weighted Voronoi region algorithms for political districting, An optimization-based heuristic for the machine reassignment problem, Large-scale pickup and delivery work area design, Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm, Network-Based Dissolution, Voronoi diagrams with overlapping regions, Political districting: from classical models to recent approaches, Imposing Contiguity Constraints in Political Districting Models, A new integer linear programming formulation for the problem of political districting, Districting for Arc Routing, 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, The coastal seaspace patrol sector design and allocation problem, Constraint-based electoral districting using a new compactness measure: an application to Portugal, Continuous approximation models in freight distribution management, Heuristic and exact algorithms for minimum-weight non-spanning arborescences, The Capacitated and Economic Districting Problem, New models for commercial territory design, Territorial design for customers with demand frequency, An Exact Solution Method for the Political Districting Problem, The Surgical Patient Routing Problem: A Central Planner Approach, Vertex covering with capacitated trees, Unnamed Item, Exact approaches for solving a covering problem with capacitated subtrees, Political districting: From classical models to recent approaches, A hierarchical location model for public facility planning, Preprocessing for a map sectorization problem by means of mathematical programming, A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design, Solving continuous location-districting problems with Voronoi diagrams, Multiple criteria districting problemsthe public transportation network pricing system of the Paris region, Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement, The geo-graph in practice: creating United States congressional districts from census blocks, A reactive GRASP for a commercial territory design problem with multiple balancing requirements, Sequential Monte Carlo for Sampling Balanced and Compact Redistricting Plans, Automated Redistricting Simulation Using Markov Chain Monte Carlo, Local search algorithms for political districting, A dual bounding scheme for a territory design problem, A multi-objective districting problem applied to agricultural machinery maintenance service network, A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization, Simultaneous node and link districting in transportation networks: model, algorithms and railway application, A simulated annealing approach to police district design, Political Districting for Elections to the German Bundestag: An Optimization-Based Multi-stage Heuristic Respecting Administrative Boundaries, Optimal location with equitable loads, A multiplicatively-weighted Voronoi diagram approach to logistics districting, Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder), Network-Based Vertex Dissolution, Political districting to minimize cut edges, Districting for salt spreading operations, Metropolized Multiscale Forest Recombination for Redistricting, A tabu search heuristic and adaptive memory procedure for political districting
Uses Software
