On the Convergence of a Hyperboloid Approximation Procedure for the Perturbed Euclidean Multifacility Location Problem
From MaRDI portal
Publication:4285172
DOI10.1287/OPRE.41.6.1164zbMATH Open0802.90067OpenAlexW2010004345MaRDI QIDQ4285172FDOQ4285172
Authors: Guoliang Xue, J. B. Rosen
Publication date: 13 March 1994
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.41.6.1164
Recommendations
- Acceleration of the HAP approach for the multifacility location problem
- The Euclidean Multifacility Location Problem
- On the Convergence of Miehle's Algorithm for the Euclidean Multifacility Location Problem
- A note on convergence in the single facility minisum location problem
- On the convergence of the generalized Weiszfeld algorithm
Cited In (12)
- Algorithms for constrained approximation and optimization. Proceedings of the workshop held in Stowe, VT, USA, May 23-26, 1993
- A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities
- ADMM-type methods for generalized multi-facility Weber problem
- A globally convergent algorithm for facility location on a sphere
- The Weiszfeld Algorithm: Proof, Amendments, and Extensions
- Location and layout planning. A survey
- Customized alternating direction methods of multipliers for generalized multi-facility Weber problem
- On an open problem in spherical facility location
- Title not available (Why is that?)
- Noncooperative facility location games
- The Euclidean Multifacility Location Problem
- A variational inequality approach for constrained multifacility Weber problem under gauge
This page was built for publication: On the Convergence of a Hyperboloid Approximation Procedure for the Perturbed Euclidean Multifacility Location Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285172)