Pages that link to "Item:Q1869686"
From MaRDI portal
The following pages link to A tabu search heuristic and adaptive memory procedure for political districting (Q1869686):
Displaying 50 items.
- Sequential Monte Carlo for Sampling Balanced and Compact Redistricting Plans (Q58510) (← links)
- A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (Q274945) (← links)
- The mixed capacitated arc routing problem with non-overlapping routes (Q319378) (← links)
- Inequity averse optimization in operational research (Q319581) (← links)
- A multi-criteria police districting problem for the efficient and effective design of patrol sector (Q319842) (← links)
- A multi-layer line search method to improve the initialization of optimization algorithms (Q320070) (← links)
- Local search heuristics for sectoring routing in a household waste collection context (Q323486) (← links)
- A redistricting problem applied to meter reading in power distribution networks (Q336759) (← links)
- A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows (Q337225) (← links)
- Dynamic design of sales territories (Q337456) (← links)
- Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm (Q342250) (← links)
- A plane graph representation of triconnected graphs (Q410724) (← 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)
- Model-based capacitated clustering with posterior regularization (Q724144) (← links)
- Towards a stochastic programming modeling framework for districting (Q827113) (← links)
- Algorithms for gerrymandering over graphs (Q831130) (← links)
- Adaptive memory programming for the vehicle routing problem with multiple trips (Q850308) (← links)
- Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study (Q853072) (← links)
- Designing delivery districts for the vehicle routing problem with stochastic demands (Q872114) (← links)
- An effective VNS for the capacitated \(p\)-median problem (Q932177) (← 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)
- Bisecting a 4-connected graph with three resource sets (Q997070) (← links)
- Heuristic methods for the sectoring arc routing problem (Q1041923) (← links)
- Visual attractiveness in routing problems: a review (Q1634050) (← links)
- Optimal partisan districting on planar geographies (Q1642801) (← links)
- Primal and dual bounds for the vertex \(p\)-median problem with balance constraints (Q1686518) (← links)
- Continuous approximation models in freight distribution management (Q1688432) (← links)
- Uniform and most uniform partitions of trees (Q1756346) (← links)
- A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem (Q1761153) (← 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)
- Modularity maximization to design contiguous policy zones for pandemic response (Q2171547) (← links)
- A new integer linear programming formulation for the problem of political districting (Q2173126) (← links)
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution (Q2178337) (← links)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- A dual bounding scheme for a territory design problem (Q2257364) (← links)
- Weighted Voronoi region algorithms for political districting (Q2389781) (← links)
- Political districting: from classical models to recent approaches (Q2393445) (← links)
- Partitioning a weighted tree into subtrees with weights in a given range (Q2428691) (← links)
- Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size (Q2466001) (← links)
- Multiple criteria districting problemsthe public transportation network pricing system of the Paris region (Q2468339) (← links)
- Local search algorithms for political districting (Q2482812) (← links)
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning (Q2515049) (← links)
- A multiplicatively-weighted Voronoi diagram approach to logistics districting (Q2565772) (← links)
