A generalized Weiszfeld method for the multi-facility location problem

DOI10.1016/j.orl.2009.11.005zbMath1188.90148OpenAlexW2084091257MaRDI QIDQ974995

Cem Iyigun, Adi Ben-Israel

Publication date: 8 June 2010

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

Full work available at URL: https://doi.org/10.1016/j.orl.2009.11.005

zbMATH Keywords

decomposition methodFermat-Weber location problemWeiszfeld methodmulti-facility location problemprobabilistic assignments

Mathematics Subject Classification ID

Continuous location (90B85)

Related Items

A PROBABILISTIC ℓ₁ METHOD FOR CLUSTERING HIGH-DIMENSIONAL DATA, Novel dual discounting functions for the Internet shopping optimization problem: new algorithms, Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs, A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set, A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function, A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities, The generalized Fermat-Torricelli problem in Hilbert spaces, On some novel methods for solving the generalized Fermat-Torricelli problem in Hilbert spaces, Planning a capacitated road network with flexible travel times: a genetic algorithm, One-dimensional center-based l 1-clustering method, Internet shopping with price sensitive discounts, Interpretation and optimization of the \(k\)-means algorithm., The planar hub location problem: a probabilistic clustering approach, \(k\)-means, Ward and probabilistic distance-based clustering methods with contiguity constraint, Weiszfeld's method: old and new results, Probabilistic d-clustering, Solving \(k\)-center problems involving sets based on optimization techniques, An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge, Backup multifacility location problem with \(l_p\) norm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the Weber location problem
• Probabilistic d-clustering
• The gravity \(p\)-median model
• Contour approximation of data: a duality theory
• A heuristic method for large-scale multi-facility location problems
• Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
• Solving the multiple competitive facilities location problem
• On the Complexity of Some Common Geometric Location Problems
• Iterative Minimization Schemes for Solving the Single Source Localization Problem
• PROBABILISTIC DISTANCE CLUSTERING ADJUSTED FOR CLUSTER SIZE
• Weber's problem and weiszfeld's algorithm in general spaces
• On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
• Heuristic Methods for Location-Allocation Problems
• Further notes on convergence of the Weiszfeld algorithm
• A note on Fermat's problem
• On Information and Sufficiency
• A modified Weiszfeld algorithm for the Fermat-Weber location problem