Pages that link to "Item:Q4180147"
From MaRDI portal
The following pages link to On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem (Q4180147):
Displaying 50 items.
- Geometric median and robust estimation in Banach spaces (Q122792) (← links)
- Accelerating convergence in minisum location problem with \(\ell p\) norms (Q336624) (← links)
- Rotation averaging (Q361258) (← links)
- Accelerating the convergence in the single-source and multi-source Weber problems (Q428088) (← links)
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand (Q429526) (← links)
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms (Q457226) (← links)
- Solution of location problems with radial cost functions (Q584914) (← links)
- Local convergence in a generalized Fermat-Weber problem (Q689230) (← links)
- A note on the Weber location problem (Q689238) (← links)
- Probabilistic d-clustering (Q734358) (← links)
- Riemannian \(L^p\) averaging on Lie group of nonzero quaternions (Q742343) (← links)
- A new bounding method for single facility location models (Q920023) (← links)
- A generalized Weiszfeld method for the multi-facility location problem (Q974995) (← links)
- The inverse Fermat-Weber problem (Q976390) (← links)
- On the convergence of the generalized Weiszfeld algorithm (Q1026601) (← links)
- Single facility location and relocation problem with time dependent weights and discrete planning horizon (Q1026603) (← links)
- Location problems with costs being sums of powers of Euclidean distances (Q1086127) (← links)
- A comparative study of heuristics for a two-level routing-location problem (Q1143306) (← links)
- Optimal location on a sphere (Q1148106) (← links)
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle (Q1148209) (← links)
- A fixed point algorithm for solving the Euclidean multifacility location problem in a tree (Q1178313) (← links)
- An optimal method for solving the (generalized) multi-Weber problem (Q1197648) (← links)
- A globally convergent algorithm for the Euclidean multiplicity location problem (Q1210269) (← links)
- Accelerating convergence in the Fermat-Weber location problem (Q1273094) (← links)
- A variable-penalty alternating directions method for convex optimization (Q1290650) (← links)
- A globally convergent algorithm for facility location on a sphere (Q1323619) (← links)
- Semi-obnoxious single facility location in Euclidean space. (Q1422376) (← links)
- A two-echelon joint continuous-discrete location model (Q1683143) (← links)
- On an open problem in spherical facility location (Q1893523) (← links)
- Algorithms for constrained approximation and optimization. Proceedings of the workshop held in Stowe, VT, USA, May 23-26, 1993 (Q1893613) (← links)
- An improved bound for the multifacility location model (Q1904759) (← links)
- On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) (Q1942259) (← links)
- On the robust PCA and Weiszfeld's algorithm (Q2019909) (← links)
- Robust PCA via regularized \textsc{Reaper} with a matrix-free proximal algorithm (Q2036201) (← links)
- An efficient noisy binary search in graphs via Median approximation (Q2115863) (← links)
- Medians in median graphs and their cube complexes in linear time (Q2119403) (← links)
- Choosing among notions of multivariate depth statistics (Q2163071) (← links)
- Single facility siting involving allocation decisions (Q2178111) (← links)
- Total cyclic variation and generalizations (Q2251198) (← links)
- Weiszfeld's method: old and new results (Q2260646) (← links)
- An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge (Q2307752) (← links)
- The optimal solution set of the multi-source Weber problem (Q2414188) (← links)
- On vector and matrix median computation (Q2428135) (← links)
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach (Q2463484) (← links)
- A graphic representation of the solution of the Weber problem in the space of the weights (Q3151940) (← links)
- Averaging Symmetric Positive-Definite Matrices (Q3300555) (← links)
- Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets (Q3422787) (← links)
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges (Q3783052) (← links)
- LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY (Q3964470) (← links)
- On the Fermat—Weber problem with convex cost functions (Q4152041) (← links)
