On the point for which the sum of the distances to \(n\) given points is minimum
From MaRDI portal
Publication:1026585
DOI10.1007/s10479-008-0352-zzbMath1176.90616OpenAlexW2161669108WikidataQ106140146 ScholiaQ106140146MaRDI QIDQ1026585
Publication date: 25 June 2009
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0352-z
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Collections of translated articles of miscellaneous specific interest (00B55) Collections of reprinted articles (00B60)
Related Items (41)
An inertial Mann algorithm for nonexpansive mappings ⋮ Location of a distribution center for a perishable product ⋮ How bad can the centroid be? ⋮ Accelerating convergence in minisum location problem with \(\ell p\) norms ⋮ Time-dependent green Weber problem ⋮ Comparison of Condorcet and Weber solutions on a plane: social choice versus centralization ⋮ The Weber obnoxious facility location model: a big arc small arc approach ⋮ A planar single-facility competitive location and design problem under the multi-deterministic choice rule ⋮ A new heuristic for solving the \(p\)-median problem in the plane ⋮ Continuous location of an assembly station ⋮ A spatial-type interval-valued median for random intervals ⋮ Ensemble clustering using factor graph ⋮ Single facility siting involving allocation decisions ⋮ Exact solution to median surface problem using 3D graph search and application to parameter space exploration ⋮ The optimal solution set of the multi-source Weber problem ⋮ On solving the planar \(k\)-centrum problem with Euclidean distances ⋮ On some novel methods for solving the generalized Fermat-Torricelli problem in Hilbert spaces ⋮ Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities ⋮ A trajectory based heuristic for the planar \(p\)-median problem ⋮ Byzantine-robust variance-reduced federated learning over distributed non-i.i.d. data ⋮ Ensemble clustering by means of clustering embedding in vector spaces ⋮ Geometric spanning trees minimizing the Wiener index ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ A projected Weiszfeld algorithm for the box-constrained Weber location problem ⋮ Levels of nonoptimality of the Weiszfeld algorithm in the least-modules method ⋮ Unnamed Item ⋮ Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem ⋮ Solving a generalized Gauss problem ⋮ Sequential location of two facilities: comparing random to optimal location of the first facility ⋮ The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution ⋮ Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams ⋮ Constructions of solutions to generalized Sylvester and Fermat-Torricelli problems for Euclidean balls ⋮ The spatial sign covariance matrix with unknown location ⋮ Applications of variational analysis to a generalized Fermat-Torricelli problem ⋮ Weiszfeld's method: old and new results ⋮ Optimal number and location of storage hubs and biogas production reactors in farmlands with allocation of multiple feedstocks ⋮ An iterative algorithm for \(l_1\)-norm approximation in dynamic estimation problems ⋮ Sparse group fused Lasso for model segmentation: a hybrid approach ⋮ Probabilistic smallest enclosing ball in high dimensions via subgradient sampling ⋮ An algorithm for computing Fréchet means on the sphere ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions
Cites Work
This page was built for publication: On the point for which the sum of the distances to \(n\) given points is minimum
