A geometric perspective of the Weiszfeld algorithm for solving the Fermat−Weber problem

2016 ◽  
Vol 50 (1) ◽  
pp. 157-173 ◽  
Author(s):  
Helder Manoel Venceslau ◽  
Marilis Bahr Karam Venceslau ◽  
Adilson Elias Xavier ◽  
Nelson Maculan
Keyword(s):  
Weber Problem ◽  
Weiszfeld Algorithm

scholarly journals Further notes on convergence of the Weiszfeld algorithm

2003 ◽  
Vol 13 (2) ◽  
pp. 199-206 ◽  
Author(s):  
Jack Brimberg
Keyword(s):  
Iterative Procedure ◽  
Convergence Property ◽  
Location Theory ◽  
Weber Problem ◽  
Weiszfeld Algorithm

The Fermat-Weber problem is one of the most widely studied problems in classical location theory. In his previous work, Brimberg (1995) attempts to resolve a conjecture posed by Chandrasekaran and Tamir (1989) on a convergence property of the Weiszfeld algorithm, a well-known iterative procedure used to solve this problem. More recently, Canovas, Marin and Canavate (2002) provide counterexamples that appear to reopen the question. However, they do not attempt to reconcile their counterexamples with the previous work. We now show that in the light of these counterexamples, the proof is readily modified and the conjecture of Chandrasekaran and Tamir reclosed. .

Weber problem in the NEG: a case study of Asia

2010 ◽  
Vol 47 (1) ◽  
pp. 37-50 ◽  
Author(s):  
Ryusuke Ihara
Keyword(s):  
Weber Problem

scholarly journals A Cross Entropy-based heuristic for the capacitated multi-source Weber problem with facility fixed cost

2015 ◽  
Vol 83 ◽  
pp. 151-158 ◽  
Author(s):  
Seyed Javad Hosseininezhad ◽  
Said Salhi ◽  
Mohammad Saeed Jabalameli
Keyword(s):  
Cross Entropy ◽  
Fixed Cost ◽  
Weber Problem

SOME LOCALIZATION THEOREMS FOR A CONSTRAINED WEBER PROBLEM*

1981 ◽  
Vol 21 (1) ◽  
pp. 103-115 ◽  
Author(s):  
P. Hansen ◽  
D. Peeters ◽  
J.-F. Thisse
Keyword(s):  
Weber Problem
Sign in / Sign up

Export Citation Format

Share Document