The p-Centre Problem-Heuristic and Optimal Algorithms
From MaRDI portal
Recommendations
Cited in
(56)- A robust and efficient algorithm for planar competitive location problems
- The p-cover problem
- A heuristic for the p-center problem in graphs
- Polynomial algorithms for restricted Euclidean p-centre 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
- Generalized p-center problems: Complexity results and approximation algorithms
- A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem
- Lexicographic local search and the \(p\)-center problem.
- The mixed center location problem
- The connected disk covering problem
- k-balanced center location problem: a new multi-objective facility location problem
- Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane
- Dominant, an algorithm for the \(p\)-center problem.
- Heuristic methods and applications: A categorized survey
- On the conditional \(p\)-median problem
- An elliptical cover problem in drone delivery network design and its solution algorithms
- Optimal covering points and curves
- Solving multiple facilities location problems with separated clusters
- Solving \(k\)-center problems involving sets based on optimization techniques
- The searching over separators strategy to solve some NP-hard problems in subexponential time
- The minimum equitable radius location problem with continuous demand
- Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem
- The discrete and mixed minimax 2-center problems
- The 1-center problem in the plane with independent random weights
- The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory
- Topological stability of kinetic \(k\)-centers
- Continuous maximal covering location problems with interconnected facilities
- Rectilinear m -Center problem
- Un nuevo resultado sobre la complejidad del problema delP-centro
- Insertion heuristics for central cycle problems
- The Weighted Euclidean 1-Center Problem
- Heuristic methods for thep-center problem
- An adaptive perturbation-based heuristic: an application to the continuous p-centre problem
- scientific article; zbMATH DE number 4141774 (Why is no real title available?)
- A Best Possible Heuristic for the k-Center Problem
- ε-Approximations for Multidimensional Weighted Location Problems
- scientific article; zbMATH DE number 3960894 (Why is no real title available?)
- An Algorithm for the p-Center Problem in the Plane
- scientific article; zbMATH DE number 34574 (Why is no real title available?)
- scientific article; zbMATH DE number 1285629 (Why is no real title available?)
- A fast algorithm for locating supplying center on a lattice
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- Facility location with dynamic distance functions
- Drezner's exact method for the continuous \(p\)-centre problem revisited
- Maximizing the minimum cover probability by emergency 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 multiple-robot assembly plan problem
- The obnoxious facilities p-center problem with forbidden regions
- Clustering in polygonal domains
- A VNS method for the conditional p-next center problem
- On weighted rectilinear 2-center and 3-center problems
- A simple heuristic for the p-centre problem
- A note on the m-center problem with rectilinear distances
- A new bounding method for single facility location models
- New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
This page was built for publication: The p-Centre Problem-Heuristic and Optimal Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3335476)
