A modified Weiszfeld algorithm for the Fermat-Weber location problem

Mathematical Programming, Series B

Volumn 90, Issue 3, 2001, Pages 559-566

  Vardi, Yehuda ^a   Zhang, Cun Hui ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 10044271480     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00011435     Document Type: Article

References (9)

1. Brimberg, J. (1995): The Fermat Weber location problem revisited. Math. Program. 71, 71-76
2. Canovas, L., Canavate, R., Marin, A. (1998): Notas sobre el algoritmo de Weiszfeld. Tech. Rep. No. 9, Faculty of Mathematics, University of Murcia, Spain
3. Chandrasekaran, R., Tamir, A. (1989): Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem. Math. Program. 44, 293-295
4. Eckhardt, U. (1980): Weber's problem and Weiszfeld's algorithm in general spaces. Math. Program. 18, 186-196
5. Katz, I.N. (1974): Local convergence in Fermat's problem. Math. Program. 6, 89-104
6. Kuhn, H.W. (1973): A note on Fermat's problem. Math. Program. 4, 98-107
7. Weber, A. (1909): Über den Standort der Industrien, Tübingen.
8. [English translation by Freidrich, C.J. (1929): Alfred Weber's Theory of Location of Industries, University of Chicago Press]
9. Weiszfeld, E. (1937): Sur le point pour lequel la somme des distances de n points donnés est minimum. Tôhoku Mathematics Journal 43, 355-386