Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
From MaRDI portal
Publication:4285171
DOI10.1287/opre.41.6.1153zbMath0795.90037OpenAlexW1967152302MaRDI QIDQ4285171
Jack Brimberg, Love, Robert F.
Publication date: 14 September 1994
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.41.6.1153
Related Items (30)
A note on an ``inverse Weber location model ⋮ Iteratively reweighted least squares and slime mold dynamics: connection and convergence ⋮ Accelerating convergence in minisum location problem with \(\ell p\) norms ⋮ Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems ⋮ Location and layout planning. A survey ⋮ The Fermat-Weber location problem revisited ⋮ On solving the planar \(k\)-centrum problem with Euclidean distances ⋮ A guided reactive GRASP for the capacitated multi-source Weber problem ⋮ On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) ⋮ Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms ⋮ Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem ⋮ A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach ⋮ Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem ⋮ New models for locating a moving service facility ⋮ \(L_q\)-closest-point to affine subspaces using the generalized Weiszfeld algorithm ⋮ Local convexity results in a generalized Fermat-Weber problem ⋮ Convex ordered median problem with \(\ell _p\)-norms ⋮ An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge ⋮ Heuristic solution of the multisource Weber problem as a \(p\)-median problem ⋮ The single facility location problem with average-distances ⋮ Accelerating convergence in the Fermat-Weber location problem ⋮ On the convergence of the generalized Weiszfeld algorithm ⋮ Solving probabilistic multi-facility Weber problem by vector quantization ⋮ Extension of the Weiszfeld procedure to a single facility minisum location model with mixed \(\ell_{p}\) norms ⋮ A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations ⋮ The convergence of the Weiszfeld algorithm ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions ⋮ A note on convergence in the single facility minisum location problem ⋮ A generalization of the rectangular bounding method for continuous location models ⋮ A continuous location-allocation problem with zone-dependent fixed cost
This page was built for publication: Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
