Technical Note—Minisum Ip Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm
From MaRDI portal
Publication:3885476
Cited in
(20)- Convex ordered median problem with \(\ell _p\)-norms
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- Locational analysis
- A fixed point algorithm for solving the Euclidean multifacility location problem in a tree
- A nonlinear optimization approach for solving facility layout problems
- A globally convergent algorithm for facility location on a sphere
- Nondifferentiability detection and dimensionality reduction in minisum multifacility location problems
- The convergence of the Weiszfeld algorithm
- A generalization of the rectangular bounding method for continuous location models
- An improved bound for the multifacility location model
- Steiner minimal trees in \(L^ 2_ p\)
- On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\)
- New models for locating a moving service facility
- Backup multifacility location problem with \(l_p\) norm
- Duality in constrained multi‐facility location models
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- The Weiszfeld Algorithm: Proof, Amendments, and Extensions
- On solving the planar k-centrum problem with Euclidean distances
- Local convergence in a generalized Fermat-Weber problem
- Node coincidence in metric minimum weighted length graph embeddings
This page was built for publication: Technical Note—Minisum Ip Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3885476)
