The p-Centre Problem-Heuristic and Optimal Algorithms
From MaRDI portal
Publication:3335476
DOI10.2307/2581980zbMath0544.90024OpenAlexW4230817896MaRDI QIDQ3335476
Publication date: 1984
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2581980
set coveringlocationpolynomial timeapproximation algorithmsp-centre problemweighted Euclidean version
Related Items
The p-cover problem, Optimal covering points and curves, The searching over separators strategy to solve some NP-hard problems in subexponential time, The mixed center location problem, The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory, The minimum equitable radius location problem with continuous demand, On the conditional \(p\)-median problem, A heuristic for the p-center problem in graphs, An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem, Topological stability of kinetic \(k\)-centers, Continuous maximal covering location problems with interconnected facilities, A faster algorithm for the constrained minimum covering circle problem to expedite solving p‐center problems in an irregularly shaped area with holes, The discrete and mixed minimax 2-center problems, The connected disk covering problem, Lexicographic local search and the \(p\)-center problem., A note on the m-center problem with rectilinear distances, A new bounding method for single facility location models, \(k\)-balanced center location problem: a new multi-objective facility location problem, The 1-center problem in the plane with independent random weights, Drezner's exact method for the continuous \(p\)-centre problem revisited, Maximizing the minimum cover probability by emergency facilities, The multiple-robot assembly plan problem, 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, The slab dividing approach to solve the Euclidean \(P\)-center problem, Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance, Rectilinear m -Center problem, Facility location with dynamic distance functions, Insertion heuristics for central cycle problems, Solving thep-Center problem with Tabu Search and Variable Neighborhood Search, Solving multiple facilities location problems with separated clusters, Solving \(k\)-center problems involving sets based on optimization techniques, Dominant, an algorithm for the \(p\)-center problem., On weighted rectilinear 2-center and 3-center problems, A robust and efficient algorithm for planar competitive location problems, A simple heuristic for the p-centre problem, Heuristic methods and applications: A categorized survey, An elliptical cover problem in drone delivery network design and its solution algorithms, A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem
