A note on convergence in the single facility minisum location problem

DOI10.1016/S0898-1221(98)00054-6zbMath0992.90043MaRDI QIDQ1608453

Jack Brimberg, Reuven Chen

Publication date: 6 August 2002

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

global convergencesingular points\(l_p\) normWeiszfeld proceduresingle facility minisum location problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (6)

Accelerating convergence in minisum location problem with \(\ell p\) norms ⋮ 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 ⋮ On solving unreliable planar location problems ⋮ \(L_q\)-closest-point to affine subspaces using the generalized Weiszfeld algorithm ⋮ Accelerating convergence in the Fermat-Weber location problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local convergence in a generalized Fermat-Weber problem
• Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
• The Fermat-Weber location problem revisited
• Location-Allocation Problems
• Mathematical Models of Road Travel Distances
• Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
• Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
• Link-Length Minimization in Networks
• Modelling Inter-city Road Distances by Mathematical Functions
• A note on Fermat's problem

This page was built for publication: A note on convergence in the single facility minisum location problem