On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
From MaRDI portal
(Redirected from Publication:4180147)
Cited in
(63)- On the robust PCA and Weiszfeld's algorithm
- Medians and means in Finsler geometry
- On the Fermat—Weber problem with convex cost functions
- Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets
- An improved bound for the multifacility location model
- Reviewing extensions and solution methods of the planar Weber single facility location problem
- An efficient noisy binary search in graphs via Median approximation
- A generalized Weiszfeld method for the multi-facility location problem
- Accelerating the convergence in the single-source and multi-source Weber problems
- The geometric median and applications to robust mean estimation
- An improved algorithm for solving the Weber location problem
- Extensions to the planar \(p\)-median problem
- An optimal method for solving the (generalized) multi-Weber problem
- Algorithms for constrained approximation and optimization. Proceedings of the workshop held in Stowe, VT, USA, May 23-26, 1993
- Rotation averaging
- A note on the Weber location problem
- Local convergence in a generalized Fermat-Weber problem
- On the convergence of the generalized Weiszfeld algorithm
- Averaging symmetric positive-definite matrices
- Optimal location on a sphere
- An Errata to: Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets
- Robust PCA via regularized \textsc{Reaper} with a matrix-free proximal algorithm
- Single facility siting involving allocation decisions
- On the probability that the optimal solution of the Weber location problem is at a demand point
- A variable-penalty alternating directions method for convex optimization
- Riemannian L^p averaging on Lie group of nonzero quaternions
- A globally convergent algorithm for facility location on a sphere
- A comparative study of heuristics for a two-level routing-location problem
- Solution of location problems with radial cost functions
- The inverse Fermat-Weber problem
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- Single facility location and relocation problem with time dependent weights and discrete planning horizon
- Choosing among notions of multivariate depth statistics
- Accelerating convergence in minisum location problem with \(\ell p\) norms
- Medians in median graphs and their cube complexes in linear time
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
- The Weiszfeld Algorithm: Proof, Amendments, and Extensions
- A graphic representation of the solution of the Weber problem in the space of the weights
- Weiszfeld's method: old and new results
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
- On an open problem in spherical facility location
- A fixed point algorithm for solving the Euclidean multifacility location problem in a tree
- Semi-obnoxious single facility location in Euclidean space.
- A two-echelon joint continuous-discrete location model
- Optimal location of a single facility with circular demand areas
- Location problems with costs being sums of powers of Euclidean distances
- A new bounding method for single facility location models
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- On vector and matrix median computation
- Total cyclic variation and generalizations
- Accelerating convergence in the Fermat-Weber location problem
- Geometric median and robust estimation in Banach spaces
- Further analysis of the Weber problem
- A globally convergent algorithm for the Euclidean multiplicity location problem
- An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
- LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY
- Probabilistic d-clustering
- On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\)
- Robust and scalable Bayes via a median of subset posterior measures
- The optimal solution set of the multi-source Weber problem
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges
- Graphs with \(G^p\)-connected medians
- Medians in median graphs and their cube complexes in linear time
This page was built for publication: On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4180147)
