The p-center location problem in an area
From MaRDI portal
Publication:4228753
DOI10.1016/S0966-8349(96)00012-5zbMath0917.90233WikidataQ127152190 ScholiaQ127152190MaRDI QIDQ4228753
Publication date: 31 May 1999
Published in: Location Science (Search for Journal in Brave)
Related Items (37)
Wildfire burn scar encapsulation. Subsetting common spatial domains for post-wildfire debris flow predictions over the United States ⋮ Covering part of a planar network ⋮ A heuristic algorithm for minimax sensor location in the plane ⋮ The equitable location problem on the plane ⋮ Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand ⋮ The minimum equitable radius location problem with continuous demand ⋮ A multi-objective model for locating search and rescue boats ⋮ Regional service coverage modeling ⋮ Heuristics for a continuous multi-facility location problem with demand regions ⋮ An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem ⋮ A faster algorithm for the constrained minimum covering circle problem to expedite solving p‐center problems in an irregularly shaped area with holes ⋮ A continuous districting model focusing on intra‐ and inter‐zonal squared distances and its Voronoi‐based heuristic ⋮ A directional approach to gradual cover ⋮ A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand ⋮ Comparative error bound theory for three location models: continuous demand versus discrete demand ⋮ The complete vertex \(p\)-center problem ⋮ Spectral partitions for Sturm–Liouville problems ⋮ Exact algorithms for the solution of the grey pattern quadratic assignment problem ⋮ Conditional facility location problems with continuous demand and a polygonal barrier ⋮ On the horseshoe conjecture for maximal distance minimizers ⋮ Sequential location of two facilities: comparing random to optimal location of the first facility ⋮ New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems ⋮ Cooperative cover of uniform demand ⋮ An approximation algorithm for \(k\)-center problem on a convex polygon ⋮ Long-term planningversusshort-term planning in the asymptotical location problem ⋮ On one-dimensional continua uniformly approximating planar sets ⋮ A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff ⋮ Optimal partitioning of an interval and applications to Sturm-Liouville eigenvalues ⋮ The variable radius covering problem ⋮ A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach ⋮ An elliptical cover problem in drone delivery network design and its solution algorithms ⋮ The support unit location problem to road traffic surveys with multi-stages ⋮ A Lipschitz Matrix for Parameter Reduction in Computational Science ⋮ Continuous Center Problems ⋮ Constrained k-Center Problem on a Convex Polygon ⋮ Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants ⋮ A Voronoi-based heuristic algorithm for locating distribution centers in disasters
This page was built for publication: The p-center location problem in an area
