New models for locating a moving service facility
From MaRDI portal
Publication:2500782
DOI10.1007/s00186-005-0011-yzbMath1103.90063OpenAlexW2078362293WikidataQ58217282 ScholiaQ58217282MaRDI QIDQ2500782
Justo Puerto, Antonio M. Rodríguez-Chía
Publication date: 18 August 2006
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-005-0011-y
Related Items (6)
Accelerating convergence in minisum location problem with \(\ell p\) norms ⋮ Site selection in the US retailing industry ⋮ 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 ⋮ Convex ordered median problem with \(\ell _p\)-norms ⋮ The single facility location problem with average-distances
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic optimization: The Fermat-Weber location problem
- Optimum positioning of moving service facility
- Accelerating convergence in the Fermat-Weber location problem
- A Newton acceleration of the Weiszfeld algorithm for minimizing the sum of Euclidean distances
- Location of a moving service facility
- On the convergence of the Weiszfeld algorithm
- The convergence of the Weiszfeld algorithm
- Principal points
- Technical Note—Minisum Ip Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm
- Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
This page was built for publication: New models for locating a moving service facility