Technical Note—Minisum Ip Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm
From MaRDI portal
Publication:3885476
DOI10.1287/opre.27.6.1180zbMath0442.90023OpenAlexW2002995018MaRDI QIDQ3885476
William A. Verdini, James G. Morris
Publication date: 1979
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.27.6.1180
uniform convergenceconvergence propertiesfacility locationcomputational experiencelogisticsperturbed problemmultifacility location problemsWeiszfeld's algorithmdifferentiable approximation functionminisum lp distance location problemsnondifferentiable convex objective function
Related Items (19)
Duality in constrained multi‐facility location models ⋮ An improved bound for the multifacility location model ⋮ Nondifferentiability detection and dimensionality reduction in minisum multifacility location problems ⋮ Steiner minimal trees in \(L^ 2_ p\) ⋮ On solving the planar \(k\)-centrum problem with Euclidean distances ⋮ On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) ⋮ Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle ⋮ Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms ⋮ 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 ⋮ Local convergence in a generalized Fermat-Weber problem ⋮ New models for locating a moving service facility ⋮ Convex ordered median problem with \(\ell _p\)-norms ⋮ The convergence of the Weiszfeld algorithm ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions ⋮ A generalization of the rectangular bounding method for continuous location models ⋮ A globally convergent algorithm for facility location on a sphere ⋮ Backup multifacility location problem with \(l_p\) norm
This page was built for publication: Technical Note—Minisum Ip Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm
