The Weighted Euclidean 1-Center Problem
From MaRDI portal
Recommendations
- Efficient algorithms for the one-dimensional \(k\)-center problem
- The p-Centre Problem-Heuristic and Optimal Algorithms
- scientific article; zbMATH DE number 34574
- An algorithm and a core set result for the weighted Euclidean one-center problem
- A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
Cited in
(56)- A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
- Layout of facilities with some fixed points
- A linear time randomizing algorithm for searching ranked functions
- On the detection of a common intersection of k convex subjects in the plane
- The weighted Euclidean 1-center problem
- 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
- On the ball spanned by balls
- A biobjective approach to recoverable robustness based on location planning
- Facility location problems with uncertainty on the plane
- On geometric optimization with few violated constraints
- Minimal time functions and the smallest intersecting ball problem with unbounded dynamics
- A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)
- Covering problems with polyellipsoids: a location analysis perspective
- Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem
- Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances
- Geometric problems in automated manufacturing.
- Locating a central hunter on the plane
- A simple linear algorithm for computing rectilinear 3-centers
- Optimizing budget allocation for center and median points
- An algorithm and a core set result for the weighted Euclidean one-center problem
- Computing a largest empty anchored cylinder, and related problems
- Geometric p-center problems with centers constrained to two lines
- A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
- Rectilinear m -Center problem
- Efficient algorithms for the weighted k-center problem on a real line
- A Meeting Scheduling Problem Respecting Time and Space
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
- ε-Approximations for Multidimensional Weighted Location Problems
- scientific article; zbMATH DE number 123788 (Why is no real title available?)
- Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I.
- Minimal enclosing discs, circumcircles, and circumcenters in normed planes. II.
- scientific article; zbMATH DE number 512834 (Why is no real title available?)
- scientific article; zbMATH DE number 1099545 (Why is no real title available?)
- Helly-type theorems in property testing
- Assigning weights to minimize the covering radius in the plane
- The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints
- Solving LP Problems via Weighted Centers
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
- scientific article; zbMATH DE number 3997512 (Why is no real title available?)
- Prune-and-search with limited workspace
- scientific article; zbMATH DE number 895364 (Why is no real title available?)
- Efficient algorithms for the one-dimensional \(k\)-center problem
- scientific article; zbMATH DE number 7622570 (Why is no real title available?)
- Weighted Euclidean centers
- Continuous center problems
- A faster algorithm for the constrained minimum covering circle problem to expedite solving p‐center problems in an irregularly shaped area with holes
- The extensive 1-median problem with radius on networks
- The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\)
- A combinatorial algorithm for the 1-median problem in R^d with the Chebyshev norm
- Conflict-tolerant and conflict-free multi-agent meeting
- The weighted Euclidean one-center problem in \(\mathbb{R}^n\)
- A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes
- On weighted rectilinear 2-center and 3-center problems
- Multi-dimensional dynamic facility location and fast computation at query points
- Enclosing weighted points with an almost-unit ball
This page was built for publication: The Weighted Euclidean 1-Center Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3316925)
