Accelerating convergence in the Fermat-Weber location problem

DOI10.1016/S0167-6377(98)00016-9zbMath0911.90239MaRDI QIDQ1273094

Reuven Chen, Doron Chen, Jack Brimberg

Publication date: 6 December 1998

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

convergenceWeiszfeld algorithmsingle facility\(l_p\) normgeneralized Fermat-Weber problemminisum location problem

Mathematics Subject Classification ID

Continuous location (90B85)

Related Items (17)

Accelerating convergence in minisum location problem with \(\ell p\) norms ⋮ On solving the planar \(k\)-centrum problem with Euclidean distances ⋮ On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) ⋮ A projected Weiszfeld algorithm for the box-constrained Weber location problem ⋮ Accelerating the convergence in the single-source and multi-source Weber problems ⋮ Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms ⋮ On the Weber facility location problem with limited distances and side constraints ⋮ Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem ⋮ Single-facility location problems in two regions with \(\ell_{1}\)- and \(\ell_q\)-norms separated by a straight line ⋮ Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem ⋮ New models for locating a moving service facility ⋮ A geometric perspective of the Weiszfeld algorithm for solving the Fermat−Weber problem ⋮ Convex ordered median problem with \(\ell _p\)-norms ⋮ Solving probabilistic multi-facility Weber problem by vector quantization ⋮ A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations ⋮ Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions

Cites Work

• Solution of location problems with radial cost functions
• Local convergence in a generalized Fermat-Weber problem
• A note on the Weber location problem
• Stepsize analysis for descent methods
• A note on convergence in the single facility minisum location problem
• Local convexity results in a generalized Fermat-Weber problem
• Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
• The Fermat-Weber location problem revisited
• Fixed Point Optimality Criteria for the Location Problem with Arbitrary Norms
• Local convergence in Fermat's problem
• On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
• Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Accelerating convergence in the Fermat-Weber location problem