A simple heuristic for the p-centre problem
From MaRDI portal
Publication:761233
DOI10.1016/0167-6377(85)90002-1zbMATH Open0556.90019OpenAlexW2013089587WikidataQ56324163 ScholiaQ56324163MaRDI QIDQ761233FDOQ761233
Authors: Martin Dyer, Alan Frieze 
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
Recommendations
Cites Work
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- On the Complexity of Some Common Geometric Location Problems
- Easy and hard bottleneck location problems
- Optimal packing and covering in the plane are NP-complete
- The p-Centre Problem-Heuristic and Optimal Algorithms
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
Cited In (45)
- Title not available (Why is that?)
- The 1-center problem in the plane with independent random weights
- Title not available (Why is that?)
- Location problems
- A simple greedy approximation algorithm for the minimum connected \(k\)-center problem
- A constructive heuristic for the uniform capacitated vertex \(k\)-center problem
- A constant-factor approximation algorithm for the \(k\)-median problem
- On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- The p-Centre Problem-Heuristic and Optimal Algorithms
- The fault-tolerant capacitated \(K\)-center problem
- Min-Max-Min Optimization with Smooth and Strongly Convex Objectives
- A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem
- An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms
- The stochastic \(p\)-hub center problem with service-level constraints
- Grouping objects in multi-band images using an improved eigenvector-based algorithm
- Compact location problems with budget and communication constraints
- Title not available (Why is that?)
- Fault tolerant \(K\)-center problems
- A heuristic for the p-center problem in graphs
- On cost-aware biased respondent group selection for minority opinion survey
- \(k\)-center problems with minimum coverage
- Facility location with dynamic distance functions
- The connected \(p\)-center problem on block graphs with forbidden vertices
- A theory and algorithms for combinatorial reoptimization
- Insertion heuristics for central cycle problems
- Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs
- Demand point aggregation for planar covering location models
- Compact location problems
- On the parameterized complexity of clustering problems for incomplete data
- A framework for demand point and solution space aggregation analysis for location models
- Clustering to minimize the sum of cluster diameters
- Lexicographic local search and the \(p\)-center problem.
- Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
- The maximal dispersion problem and the ``first point outside the neighbourhood heuristic
- The weighted \(k\)-center problem in trees for fixed \(k\)
- Designing and reporting on computational experiments with heuristic methods
- A Best Possible Heuristic for the k-Center Problem
- Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs
- Title not available (Why is that?)
- Complexity and approximability of certain bicriteria location problems
- An approximation algorithm for the edge-dilation \(k\)-center problem.
This page was built for publication: A simple heuristic for the p-centre problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761233)
