A continuous districting model focusing on intra‐ and inter‐zonal squared distances and its Voronoi‐based heuristic
From MaRDI portal
Publication:6070495
Cites work
- A computational method for optimizing the shape and location of a polygon on a plane
- A multi‐period multi‐criteria districting problem applied to primary care scheme with gradual assignment
- A redistricting problem applied to meter reading in power distribution networks
- Approximate formulas of average distances associated with regions and their applications to location problems
- Combining Wang-Landau sampling algorithm and heuristics for solving the unequal-area dynamic facility layout problem
- District design for arc-routing applications
- Equity-Efficiency Bicriteria Location with Squared Euclidean Distances
- Exact solution of emerging quadratic assignment problems
- scientific article; zbMATH DE number 1803767 (Why is no real title available?)
- scientific article; zbMATH DE number 1455125 (Why is no real title available?)
- Near-Optimal Solutions to a 2-Dimensional Placement Problem
- Optimal facility layout design
- Solving a home-care districting problem in an urban setting
- Structural properties of Voronoi diagrams in facility location problems with continuous demand
- The equitable location problem on the plane
- The facility layout problem
- The minimum equitable radius location problem with continuous demand
- The p-center location problem in an area
- The quadratic assignment problem
This page was built for publication: A continuous districting model focusing on intra‐ and inter‐zonal squared distances and its Voronoi‐based heuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6070495)