Solving the continuous space p-centre problem: planning application issues
From MaRDI portal
Publication:5427782
DOI10.1093/IMAMAN/DPL009zbMath1126.90047OpenAlexW2009259425MaRDI QIDQ5427782
Alan T. Murray, Hu Wei, Ningchuan Xiao
Publication date: 27 November 2007
Published in: IMA Journal of Management Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imaman/dpl009
Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (11)
The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory ⋮ Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand ⋮ New algorithms for \(k\)-center and extensions ⋮ An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem ⋮ Optimal covering of solid bodies by spheres via the hyperbolic smoothing technique ⋮ A faster algorithm for the constrained minimum covering circle problem to expedite solving p‐center problems in an irregularly shaped area with holes ⋮ Conditional facility location problems with continuous demand and a polygonal barrier ⋮ Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane ⋮ New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems ⋮ An elliptical cover problem in drone delivery network design and its solution algorithms ⋮ New Algorithms for k-Center and Extensions
This page was built for publication: Solving the continuous space p-centre problem: planning application issues
