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.90023MaRDI QIDQ3885476
James G. Morris, William A. Verdini
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 convergence; convergence properties; facility location; computational experience; logistics; perturbed problem; multifacility location problems; Weiszfeld's algorithm; differentiable approximation function; minisum lp distance location problems; nondifferentiable convex objective function
90B05: Inventory, storage, reservoirs
Related Items
Duality in constrained multi‐facility location models, On solving the planar \(k\)-centrum problem with Euclidean distances, Local convergence in a generalized Fermat-Weber problem, 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
