Further analysis of the Weber problem

DOI10.1007/S11067-024-09627-1MaRDI QIDQ6908689zbMATH OpenFDO

Authors Pawel Kalczynski, Zvi Drezner

Publication date 30 October 2025

Published in Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11067-024-09627-1

Mathematics Subject Classification ID

Numerical methods for mathematical programming, optimization and variational techniques (65Kxx) Operations research and management science (90Bxx) Mathematical programming (90Cxx)

Cites work

• A destination optimality in asymmetric distance Fermat-Weber problems
• A directional approach to gradual cover
• A modified Weiszfeld algorithm for the Fermat-Weber location problem
• A note on the Weber location problem
• Aggregation Error Bounds for a Class of Location Models
• Aggregation error for location models: Survey and analysis
• Algebraic optimization: The Fermat-Weber location problem
• Asymmetric distance location model
• Asymmetric distances, semidirected networks and majority in Fermat-Weber problems
• Asymptotic behavior of the Weber location problem on the plane
• Contributions to location analysis. In honor of Zvi Drezner's 75th birthday
• Four-point Fermat location problems revisited. New proofs and extensions of old results
• Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
• Heuristic Methods for Location-Allocation Problems
• scientific article; zbMATH DE number 1803754 (Why is no real title available?)
• scientific article; zbMATH DE number 4123493 (Why is no real title available?)
• scientific article; zbMATH DE number 1253040 (Why is no real title available?)
• Location science
• Location Theory, Dominance, and Convexity
• Location with acceleration-deceleration distance
• Location-Allocation Problems
• Multipurpose shopping trips and location
• On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
• On the point for which the sum of the distances to n given points is minimum
• Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
• Optimal location of a facility relative to area demands
• Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
• Replacing continuous demand with discrete demand in a competitive location model
• Solving non-linear optimization problems by a trajectory approach
• Sur le point pour lequel la somme des distances de \(n\) points donnés est minimum.
• The \(p\)-median problem: a survey of metaheuristic approaches
• The Asymmetric Distance Location Problem
• The fortified Weiszfeld algorithm for solving the Weber problem
• The gravity p-median model
• The Weiszfeld Algorithm: Proof, Amendments, and Extensions
• Weiszfeld's method: old and new results

Cited in

(3)

• Reviewing extensions and solution methods of the planar Weber single facility location problem
• On the probability that the optimal solution of the Weber location problem is at a demand point
• The Weber problem with demand uniformly generated in discs

This page was built for publication: Further analysis of the Weber problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6908689)