On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\)
From MaRDI portal
Publication:1942259
DOI10.1007/s10107-011-0501-zzbMath1262.90080OpenAlexW1969272506MaRDI QIDQ1942259
C. Valero-Franco, Antonio M. Rodríguez-Chía
Publication date: 18 March 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0501-z
Related Items
Accelerating convergence in minisum location problem with \(\ell p\) norms ⋮ Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms ⋮ Continuous location under the effect of `refraction' ⋮ Single-facility location problems in two regions with \(\ell_{1}\)- and \(\ell_q\)-norms separated by a straight line
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solution of location problems with radial cost functions
- Local convergence in a generalized Fermat-Weber problem
- A note on the Weber location problem
- Convex ordered median problem with \(\ell _p\)-norms
- The single facility location problem with average-distances
- Location problems with costs being sums of powers of Euclidean distances
- Accelerating convergence in the Fermat-Weber location problem
- Location of a moving service facility
- On the convergence of the Weiszfeld algorithm
- On the convergence of a modified algorithm for the spherical facility location problem
- The convergence of the Weiszfeld algorithm
- A note on convergence in the single facility minisum location problem
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- Minisum location with closest Euclidean distances
- The Fermat-Weber location problem revisited
- New models for locating a moving service facility
- Mathematical Models of Road Travel Distances
- Weber's problem and weiszfeld's algorithm in general spaces
- Technical Note—Minisum Ip Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm
- Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
- A New Distance Function for Modeling Travel Distances in a Transportation Network
- Local convergence in Fermat's problem
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- A note on accelerating the weiszfeld procedure
- Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
- Further notes on convergence of the Weiszfeld algorithm
- On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium Problems
- A note on Fermat's problem
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
- Optimal location of a single facility with circular demand areas
This page was built for publication: On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\)
