메뉴 건너뛰기




Volumn 32, Issue 3, 2005, Pages 188-195

On the Fermat-Weber center of a convex object

Author keywords

Approximation algorithms; Fermat Weber center

Indexed keywords


EID: 84867949402     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2005.01.002     Document Type: Article
Times cited : (22)

References (5)
  • 1
    • 0041062256 scopus 로고
    • The algebraic degree of geometric optimization problems
    • C. Bajaj The algebraic degree of geometric optimization problems Discrete Comput. Geom. 3 1988 177 191
    • (1988) Discrete Comput. Geom. , vol.3 , pp. 177-191
    • Bajaj, C.1
  • 2
    • 84867943034 scopus 로고    scopus 로고
    • Fast approximations for sums of distances, clustering and the Fermat-Weber problem
    • P. Bose, A. Maheshwari, and P. Morin Fast approximations for sums of distances, clustering and the Fermat-Weber problem Computational Geometry 24 3 2003 135 146
    • (2003) Computational Geometry , vol.24 , Issue.3 , pp. 135-146
    • Bose, P.1    Maheshwari, A.2    Morin, P.3
  • 3
    • 0025385328 scopus 로고
    • Algebraic optimization: The Fermat-Weber location problem
    • R. Chandrasekaran, and A. Tamir Algebraic optimization: The Fermat-Weber location problem Math. Programming 46 2 1990 219 224
    • (1990) Math. Programming , vol.46 , Issue.2 , pp. 219-224
    • Chandrasekaran, R.1    Tamir, A.2
  • 5
    • 0002728201 scopus 로고
    • The Weber problem: History and perspectives
    • G. Wesolowsky The Weber problem: History and perspectives Location Sci. 1 1 1993 5 23
    • (1993) Location Sci. , vol.1 , Issue.1 , pp. 5-23
    • Wesolowsky, G.1


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