Pages that link to "Item:Q3316925"

The following pages link to The Weighted Euclidean 1-Center Problem (Q3316925):

Displaying 47 items.

• Optimizing budget allocation for center and median points (Q265070) (← links)
• A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\) (Q301399) (← links)
• Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I. (Q419378) (← links)
• Minimal enclosing discs, circumcircles, and circumcenters in normed planes. II. (Q419505) (← links)
• Prune-and-search with limited workspace (Q473192) (← links)
• Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
• A combinatorial algorithm for the 1-median problem in \(\mathbb R^d\) with the Chebyshev norm (Q613330) (← links)
• A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes (Q689920) (← links)
• On weighted rectilinear 2-center and 3-center problems (Q757236) (← links)
• Multi-dimensional dynamic facility location and fast computation at query points (Q976128) (← links)
• Enclosing weighted points with an almost-unit ball (Q990963) (← links)
• A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane (Q1007585) (← links)
• Layout of facilities with some fixed points (Q1086124) (← links)
• A linear time randomizing algorithm for searching ranked functions (Q1101237) (← links)
• On the detection of a common intersection of k convex subjects in the plane (Q1111021) (← links)
• The weighted Euclidean 1-center problem (Q1165764) (← links)
• The slab dividing approach to solve the Euclidean \(P\)-center problem (Q1207325) (← links)
• Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance (Q1208455) (← links)
• On the ball spanned by balls (Q1264087) (← links)
• A biobjective approach to recoverable robustness based on location planning (Q1753588) (← links)
• Facility location problems with uncertainty on the plane (Q1779686) (← links)
• On geometric optimization with few violated constraints (Q1906043) (← links)
• Minimal time functions and the smallest intersecting ball problem with unbounded dynamics (Q1937003) (← links)
• A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\) (Q1941021) (← links)
• Covering problems with polyellipsoids: a location analysis perspective (Q2028797) (← links)
• Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem (Q2301135) (← links)
• Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances (Q2301150) (← links)
• Geometric problems in automated manufacturing. (Q2468599) (← links)
• Locating a central hunter on the plane (Q2481118) (← links)
• A simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
• An algorithm and a core set result for the weighted Euclidean one-center problem (Q2899026) (← links)
• Geometric p-Center Problems with Centers Constrained to Two Lines (Q2958084) (← links)
• Rectilinear <i>m</i> -Center problem (Q3035110) (← links)
• A Meeting Scheduling Problem Respecting Time and Space (Q3511415) (← links)
• Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games (Q3688122) (← links)
• ε-Approximations for Multidimensional Weighted Location Problems (Q3694957) (← links)
• Helly-Type Theorems in Property Testing (Q4631011) (← links)
• The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints (Q4636550) (← links)
• Solving LP Problems via Weighted Centers (Q4717550) (← links)
• (Q5051496) (← links)
• Weighted Euclidean centers (Q5466707) (← links)
• Continuous Center Problems (Q5506719) (← links)
• A faster algorithm for the constrained minimum covering circle problem to expedite solving <i>p</i>‐center problems in an irregularly shaped area with holes (Q6053130) (← links)
• The extensive 1-median problem with radius on networks (Q6091088) (← links)
• The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\) (Q6103201) (← links)
• Conflict-tolerant and conflict-free multi-agent meeting (Q6136090) (← links)
• The weighted Euclidean one-center problem in \(\mathbb{R}^n\) (Q6624439) (← links)