A simple heuristic for the p-centre problem
From MaRDI portal
Publication:761233
DOI10.1016/0167-6377(85)90002-1zbMath0556.90019OpenAlexW2013089587WikidataQ56324163 ScholiaQ56324163MaRDI QIDQ761233
Publication date: 1985
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(85)90002-1
Related Items (38)
A simple greedy approximation algorithm for the minimum connected \(k\)-center problem ⋮ The stochastic \(p\)-hub center problem with service-level constraints ⋮ Clustering to minimize the sum of cluster diameters ⋮ A framework for demand point and solution space aggregation analysis for location models ⋮ On cost-aware biased respondent group selection for minority opinion survey ⋮ A heuristic for the p-center problem in graphs ⋮ The maximal dispersion problem and the ``first point outside the neighbourhood heuristic ⋮ An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms ⋮ Grouping objects in multi-band images using an improved eigenvector-based algorithm ⋮ Designing and reporting on computational experiments with heuristic methods ⋮ Compact location problems ⋮ Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs ⋮ Min-Max-Min Optimization with Smooth and Strongly Convex Objectives ⋮ Compact location problems with budget and communication constraints ⋮ Complexity and approximability of certain bicriteria location problems ⋮ The connected \(p\)-center problem on block graphs with forbidden vertices ⋮ On the parameterized complexity of clustering problems for incomplete data ⋮ On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph ⋮ Lexicographic local search and the \(p\)-center problem. ⋮ A theory and algorithms for combinatorial reoptimization ⋮ The 1-center problem in the plane with independent random weights ⋮ The fault-tolerant capacitated \(K\)-center problem ⋮ On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems ⋮ An approximation algorithm for the edge-dilation \(k\)-center problem. ⋮ \(k\)-center problems with minimum coverage ⋮ Facility location with dynamic distance functions ⋮ Insertion heuristics for central cycle problems ⋮ Solving thep-Center problem with Tabu Search and Variable Neighborhood Search ⋮ Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs ⋮ Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints ⋮ The weighted \(k\)-center problem in trees for fixed \(k\) ⋮ Fault tolerant \(K\)-center problems ⋮ A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem ⋮ Unnamed Item ⋮ Location problems ⋮ Unnamed Item ⋮ A constant-factor approximation algorithm for the \(k\)-median problem ⋮ Demand point aggregation for planar covering location models
Cites Work
- Easy and hard bottleneck location problems
- Optimal packing and covering in the plane are NP-complete
- On the Complexity of Some Common Geometric Location Problems
- The p-Centre Problem-Heuristic and Optimal Algorithms
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
This page was built for publication: A simple heuristic for the p-centre problem
