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 20 items.
- A robust algorithm for bisecting a triconnected graph with two resource sets (Q2566018) (← links)
- Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder) (Q2568600) (← links)
- A scatter search heuristic for the capacitated clustering problem (Q2570154) (← links)
- An optimization-based approach for the healthcare districting under uncertainty (Q2669521) (← links)
- Constraint-based electoral districting using a new compactness measure: an application to Portugal (Q2676289) (← links)
- Solving the segmentation problem for the 2010 argentine census with integer programming (Q2840723) (← links)
- Districting for Arc Routing (Q2940070) (← links)
- A mini–max spanning forest approach to the political districting problem (Q3183734) (← links)
- Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems (Q3621930) (← links)
- Solving a home-care districting problem in an urban setting (Q4661183) (← links)
- A practical exact algorithm for the shortest loop design problem in a block layout (Q4681149) (← links)
- Redistricting algorithms (Q5050043) (← links)
- Automated Redistricting Simulation Using Markov Chain Monte Carlo (Q5066742) (← links)
- Imposing Contiguity Constraints in Political Districting Models (Q5080650) (← links)
- Minmax Tree Cover in the Euclidean Space (Q5901435) (← links)
- A simulated annealing approach to police district design (Q5959389) (← links)
- A sample approximation solution procedure for chance-constrained districting problems (Q6068707) (← links)
- Tabu search with strategic oscillation for improving collection assignment plans of waste electric and electronic equipment (Q6079874) (← links)
- A multi‐period multi‐criteria districting problem applied to primary care scheme with gradual assignment (Q6088170) (← links)
- How to know it is ``the one''? Selecting the most suitable solution from the Pareto optimal set. Application to sectorization (Q6566828) (← links)