메뉴 건너뛰기
Mathematical Programming, Series B
Volumn 93, Issue 2, 2002, Pages 327-330
On the convergence of the Weiszfeld algorithm
Author keywords

[No Author keywords available]
Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING;
EID: 24744467496     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070200297     Document Type: Article
Times cited : (20)
References (5)
  • 1
    • 0029194762 scopus 로고
    • The Fermat-Weber location problem revisited
    • Brimberg, J. (1995): The Fermat-Weber location problem revisited. Math. Program. 71, 71-76
    • (1995) Math. Program. , vol.71 , pp. 71-76
    • Brimberg, J.1
  • 2
    • 0032068239 scopus 로고    scopus 로고
    • A note on convergence in the single facility minisum location problem
    • Brimberg, J., Chen, R. (1998): A note on convergence in the Single Facility Minisum Location Problem. Comput. Math. Appl. 35, 25-31
    • (1998) Comput. Math. Appl. , vol.35 , pp. 25-31
    • Brimberg, J.1    Chen, R.2
  • 3
    • 0000052888 scopus 로고
    • Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
    • Chandrasekaran, R., Tamir, A. (1989): Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem. Math. Program. 44, 293-295
    • (1989) Math. Program. , vol.44 , pp. 293-295
    • Chandrasekaran, R.1    Tamir, A.2
  • 4
    • 34250438259 scopus 로고
    • A note on Fermat's problem
    • Kuhn, H.W. (1973): A note on Fermat's problem. Math. Program. 4, 98-107
    • (1973) Math. Program. , vol.4 , pp. 98-107
    • Kuhn, H.W.1
  • 5
    • 0000281286 scopus 로고
    • Sur le point pour lequal la somme des distances de n points donnés est minimum
    • Weiszfeld, E.V. (1937): Sur le point pour lequal la somme des distances de n points donnés est minimum. Tohoku Math. J. 43, 335-386
    • (1937) Tohoku Math. J. , vol.43 , pp. 335-386
    • Weiszfeld, E.V.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.