Pages that link to "Item:Q2784017"
From MaRDI portal
The following pages link to An Optimization Based Heuristic for Political Districting (Q2784017):
Displaying 50 items.
- Sequential Monte Carlo for Sampling Balanced and Compact Redistricting Plans (Q58510) (← links)
- A multi-criteria police districting problem for the efficient and effective design of patrol sector (Q319842) (← links)
- Dynamic design of sales territories (Q337456) (← links)
- An optimization-based heuristic for the machine reassignment problem (Q338859) (← links)
- Large-scale pickup and delivery work area design (Q339655) (← links)
- Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm (Q342250) (← links)
- The coastal seaspace patrol sector design and allocation problem (Q395695) (← links)
- New models for commercial territory design (Q411270) (← links)
- Preprocessing for a map sectorization problem by means of mathematical programming (Q490244) (← links)
- Political districting: From classical models to recent approaches (Q657583) (← links)
- The geo-graph in practice: creating United States congressional districts from census blocks (Q683330) (← links)
- Algorithms for gerrymandering over graphs (Q831130) (← links)
- Solving continuous location-districting problems with Voronoi diagrams (Q947939) (← links)
- A reactive GRASP for a commercial territory design problem with multiple balancing requirements (Q955609) (← links)
- Optimal location with equitable loads (Q1026600) (← links)
- Districting for salt spreading operations (Q1598721) (← links)
- Optimal partisan districting on planar geographies (Q1642801) (← links)
- Continuous approximation models in freight distribution management (Q1688432) (← links)
- Exact approaches for solving a covering problem with capacitated subtrees (Q1722966) (← links)
- A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design (Q1744533) (← links)
- A tabu search heuristic and adaptive memory procedure for political districting (Q1869686) (← links)
- A multi-objective districting problem applied to agricultural machinery maintenance service network (Q2024004) (← links)
- A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization (Q2026965) (← links)
- Simultaneous node and link districting in transportation networks: model, algorithms and railway application (Q2030544) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- A new integer linear programming formulation for the problem of political districting (Q2173126) (← links)
- Goal programming approach for political districting in Santa Catarina state: Brazil (Q2178309) (← links)
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution (Q2178337) (← links)
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences (Q2189916) (← links)
- A dual bounding scheme for a territory design problem (Q2257364) (← links)
- A computational approach to unbiased districting (Q2389779) (← links)
- Weighted Voronoi region algorithms for political districting (Q2389781) (← links)
- Voronoi diagrams with overlapping regions (Q2393120) (← links)
- Political districting: from classical models to recent approaches (Q2393445) (← links)
- A hierarchical location model for public facility planning (Q2456408) (← links)
- Multiple criteria districting problemsthe public transportation network pricing system of the Paris region (Q2468339) (← links)
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement (Q2471278) (← links)
- Local search algorithms for political districting (Q2482812) (← links)
- A multiplicatively-weighted Voronoi diagram approach to logistics districting (Q2565772) (← links)
- Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder) (Q2568600) (← links)
- Constraint-based electoral districting using a new compactness measure: an application to Portugal (Q2676289) (← links)
- Political Districting for Elections to the German Bundestag: An Optimization-Based Multi-stage Heuristic Respecting Administrative Boundaries (Q2806924) (← links)
- A note on equity across groups in facility location (Q2892131) (← links)
- Network-Based Dissolution (Q2922597) (← links)
- Districting for Arc Routing (Q2940070) (← links)
- The Surgical Patient Routing Problem: A Central Planner Approach (Q2960361) (← links)
- A mini–max spanning forest approach to the political districting problem (Q3183734) (← links)
- Metropolized Multiscale Forest Recombination for Redistricting (Q5022764) (← links)
- Redistricting algorithms (Q5050043) (← links)
