Solving the continuous space p-centre problem: planning application issues
From MaRDI portal
Recommendations
- Heuristic methods for thep-center problem
- A new heuristic for solving the \(p\)-median problem in the plane
- Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities
- Locational optimization problems solved through Voronoi diagrams
- Structural properties of Voronoi diagrams in facility location problems with continuous demand
Cited in
(12)- Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane
- An elliptical cover problem in drone delivery network design and its solution algorithms
- Conditional facility location problems with continuous demand and a polygonal barrier
- The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory
- Optimal covering of solid bodies by spheres via the hyperbolic smoothing technique
- An adaptive perturbation-based heuristic: an application to the continuous p-centre problem
- Structural properties of Voronoi diagrams in facility location problems with continuous demand
- New Algorithms for k-Center and Extensions
- A faster algorithm for the constrained minimum covering circle problem to expedite solving p‐center problems in an irregularly shaped area with holes
- Beyond location modeling and GIS: integration and bridging
- New algorithms for \(k\)-center and extensions
- New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
This page was built for publication: Solving the continuous space p-centre problem: planning application issues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5427782)
