On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
From MaRDI portal
Publication:4180147
DOI10.1287/opre.26.4.597zbMath0396.90073OpenAlexW1970928279WikidataQ29308166 ScholiaQ29308166MaRDI QIDQ4180147
Publication date: 1978
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.26.4.597
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Rate of convergence, degree of approximation (41A25)
Related Items (57)
Medians in median graphs and their cube complexes in linear time ⋮ LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY ⋮ Location problems with costs being sums of powers of Euclidean distances ⋮ On an open problem in spherical facility location ⋮ Algorithms for constrained approximation and optimization. Proceedings of the workshop held in Stowe, VT, USA, May 23-26, 1993 ⋮ An Errata to: Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets ⋮ Accelerating convergence in minisum location problem with \(\ell p\) norms ⋮ An improved bound for the multifacility location model ⋮ Choosing among notions of multivariate depth statistics ⋮ Rotation averaging ⋮ Single facility siting involving allocation decisions ⋮ The optimal solution set of the multi-source Weber problem ⋮ A two-echelon joint continuous-discrete location model ⋮ A comparative study of heuristics for a two-level routing-location problem ⋮ Graphs with \(G^p\)-connected medians ⋮ On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) ⋮ Optimal location on a sphere ⋮ Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle ⋮ Extensions to the planar \(p\)-median problem ⋮ On vector and matrix median computation ⋮ Accelerating the convergence in the single-source and multi-source Weber problems ⋮ A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand ⋮ A primal-dual algorithm for the fermat-weber problem involving mixed gauges ⋮ Semi-obnoxious single facility location in Euclidean space. ⋮ A new bounding method for single facility location models ⋮ Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms ⋮ A fixed point algorithm for solving the Euclidean multifacility location problem in a tree ⋮ Averaging Symmetric Positive-Definite Matrices ⋮ A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach ⋮ An optimal method for solving the (generalized) multi-Weber problem ⋮ Total cyclic variation and generalizations ⋮ Local convergence in a generalized Fermat-Weber problem ⋮ A note on the Weber location problem ⋮ Medians and means in Finsler geometry ⋮ A globally convergent algorithm for the Euclidean multiplicity location problem ⋮ Weiszfeld's method: old and new results ⋮ A generalized Weiszfeld method for the multi-facility location problem ⋮ The inverse Fermat-Weber problem ⋮ On the robust PCA and Weiszfeld's algorithm ⋮ Optimal location of a single facility with circular demand areas ⋮ On the Fermat—Weber problem with convex cost functions ⋮ Solution of location problems with radial cost functions ⋮ Geometric median and robust estimation in Banach spaces ⋮ Robust PCA via regularized \textsc{Reaper} with a matrix-free proximal algorithm ⋮ Probabilistic d-clustering ⋮ Riemannian \(L^p\) averaging on Lie group of nonzero quaternions ⋮ An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge ⋮ Accelerating convergence in the Fermat-Weber location problem ⋮ On the convergence of the generalized Weiszfeld algorithm ⋮ Single facility location and relocation problem with time dependent weights and discrete planning horizon ⋮ Robust and Scalable Bayes via a Median of Subset Posterior Measures ⋮ A variable-penalty alternating directions method for convex optimization ⋮ Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions ⋮ An efficient noisy binary search in graphs via Median approximation ⋮ A globally convergent algorithm for facility location on a sphere ⋮ A graphic representation of the solution of the Weber problem in the space of the weights
This page was built for publication: On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
