Local convergence in a generalized Fermat-Weber problem
From MaRDI portal
Recommendations
- Accelerating convergence in the Fermat-Weber location problem
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
- The Fermat-Weber location problem revisited
- On the convergence of the generalized Weiszfeld algorithm
Cites work
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A Cut Approach to the Rectilinear Distance Facility Location Problem
- A note on Fermat's problem
- Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
- Fixed Point Optimality Criteria for the Location Problem with Arbitrary Norms
- Local convergence in Fermat's problem
- Location-Allocation Problems
- Mathematical Models of Road Travel Distances
- Modelling Inter-city Road Distances by Mathematical Functions
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- Some Properties of Location Problems with Block and Round Norms
- Technical Note—Minisum Ip Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm
- Technical Note—The Optimal Location of New Facilities Using Rectangular Distances
Cited in
(27)- Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets
- A generalization of the rectangular bounding method for continuous location models
- A projected Weiszfeld algorithm for the box-constrained Weber location problem
- On the Continuous Fermat-Weber Problem
- Approximate center points in dense point sets
- A note on the Weber location problem
- A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem
- On the convergence of the generalized Weiszfeld algorithm
- On Newton's method for the Fermat-Weber location problem
- Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- A geometric perspective of the Weiszfeld algorithm for solving the Fermat-Weber problem
- Accelerating convergence in minisum location problem with \(\ell p\) norms
- Weiszfeld's method: old and new results
- Extension of the Weiszfeld procedure to a single facility minisum location model with mixed \(\ell_{p}\) norms
- Local convexity results in a generalized Fermat-Weber problem
- Location problems with costs being sums of powers of Euclidean distances
- Accelerating convergence in the Fermat-Weber location problem
- The convergence of the Weiszfeld algorithm
- A note on convergence in the single facility minisum location problem
- Algebraic optimization: The Fermat-Weber location problem
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- A note on Fermat's problem
- The Fermat-Weber location problem revisited
- On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\)
- An iterative method for solving the Weber problem in \(\mathbb{R}^2\) with \(l_p\) norms, \(p\in (1,2)\), based in linear programming
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges
This page was built for publication: Local convergence in a generalized Fermat-Weber problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689230)
