Reviewing extensions and solution methods of the planar Weber single facility location problem

DOI10.1016/J.COR.2024.106825MaRDI QIDQ6979073zbMATH OpenFDO

Authors Richard L. Church, Zvi Drezner, Frank Plastria, Arie Tamir

Publication date 26 May 2025

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2024.106825

zbMATH Keywords

solution algorithmWeber problemlocation analysisnon-linear programming

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• scientific article; zbMATH DE number 1803754 (Why is no real title available?)
• scientific article; zbMATH DE number 3863589 (Why is no real title available?)
• scientific article; zbMATH DE number 3950165 (Why is no real title available?)
• scientific article; zbMATH DE number 4074780 (Why is no real title available?)
• scientific article; zbMATH DE number 37089 (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?)
• scientific article; zbMATH DE number 1253058 (Why is no real title available?)
• scientific article; zbMATH DE number 679868 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 1054765 (Why is no real title available?)
• scientific article; zbMATH DE number 1094753 (Why is no real title available?)
• scientific article; zbMATH DE number 1094765 (Why is no real title available?)
• scientific article; zbMATH DE number 821272 (Why is no real title available?)
• scientific article; zbMATH DE number 3246195 (Why is no real title available?)
• A Trajectory Method for the Optimization of the Multi-Facility Location Problem With lp Distances
• A branch-and-price approach for the continuous multifacility monotone ordered median problem
• A destination optimality in asymmetric distance Fermat-Weber problems
• A directional approach to gradual cover
• A maximum b-matching problem arising from median location models with applications to the roommates problem
• A modified Weiszfeld algorithm for the Fermat-Weber location problem
• A note on Fermat's problem
• A note on accelerating the weiszfeld procedure
• A note on the Weber location problem
• A planimetric theorem.
• A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
• Aggregation Error Bounds for a Class of Location Models
• Aggregation error for location models: Survey and analysis
• Algebraic optimization: The Fermat-Weber location problem
• An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
• An O(n) algorithm for the linear multiple choice knapsack problem and related problems
• An algorithm for Weber's problem on the sphere
• An efficient algorithm for facility location in the presence of forbidden regions
• An efficient heuristic for the \(k\)-partitioning problem
• An improved algorithm for solving the 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
• Complexity results for the \(p\)-median problem with mutual communication
• Continuous location of an assembly station
• Continuous location of dimensional structures.
• Continuous location under the effect of `refraction'
• Continuous multifacility ordered median location problems
• Contributions to location analysis. In honor of Zvi Drezner's 75th birthday
• Einfache Beweise der isoperimetrischen Hauptsätze.
• Extensions to the Weber problem
• Extensions to the planar \(p\)-median problem
• Facility Location on a Sphere
• Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
• Fast approximations for sums of distances, clustering and the Fermat-Weber problem
• Finding an Euclidean anti-\(k\)-centrum location of a set of points
• Fixed gate point location problems
• Four-point Fermat location problems revisited. New proofs and extensions of old results
• Further analysis of the Weber problem
• GBSSS: The generalized big square small square method for planar single- facility location
• Gate points in continuous location between regions with different \(\ell _{p}\) norms
• Geometric median in nearly linear time
• Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
• Global optimization algorithm for capacitated multi-facility continuous location-allocation problems
• Heuristic Methods for Location-Allocation Problems
• How bad can the centroid be?
• Interior point methods for second-order cone programming and OR applications
• Link-Length Minimization in Networks
• Local convergence in Fermat's problem
• Locating lines and hyperplanes. Theory and algorithms
• Location science
• Location theory. A unified approach
• Location with acceleration-deceleration distance
• Location-Allocation Problems
• Nonsmooth algorithms and Nesterov's smoothing technique for generalized Fermat-Torricelli problems
• On solving the planar k-centrum problem with Euclidean distances
• On the Continuous Fermat-Weber Problem
• On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
• On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium Problems
• On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems
• On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\)
• On the multisource hyperplanes location problem to fitting set of points
• On the point for which the sum of the distances to n given points is minimum
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
• Optimal location of a facility relative to area demands
• Optimal location on a sphere
• Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Polyhedral approximations in p-order cone programming
• QUADRATIC ORDERED MEDIAN LOCATION PROBLEMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• Replacing continuous demand with discrete demand in a competitive location model
• Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
• Runtime guarantees for regression problems
• Single facility siting involving allocation decisions
• Solving non-linear optimization problems by a trajectory approach
• Solving the 1-median problem on a network with continuous demand and demand surplus
• Solving the median problem with continuous demand on a network
• Solving the ordered one-median problem in the plane
• Steiner tree problems
• Sur le point pour lequel la somme des distances de \(n\) points donnés est minimum.
• Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
• Technical Note—On Location Dominance on Spherical Surfaces
• The Asymmetric Distance Location Problem
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• The Palgrave handbook of operations research
• The Weber Problem On The Plane With Some Negative Weights
• The Weber obnoxious facility location model: a big arc small arc approach
• The Weber problem with regional demand
• The Weiszfeld Algorithm: Proof, Amendments, and Extensions
• The k-centrum straight-line location problem
• The \(p\)-median problem: a survey of metaheuristic approaches
• The algebraic degree of geometric optimization problems
• The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods
• The ellipsoid method and its consequences in combinatorial optimization
• The fortified Weiszfeld algorithm for solving the Weber problem
• The ordered median Euclidean straight-line location problem
• Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams
• Weber problems with alternative transportation systems
• Weiszfeld's method: old and new results

Cited in

(2)

• 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: Reviewing extensions and solution methods of the planar Weber single facility location problem

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