Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

ε -Approximations for Multidimensional Weighted Location Problems

Zvi Drezner and Bezalel Gavish
Operations Research
Vol. 33, No. 4 (Jul. - Aug., 1985), pp. 772-783
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/170711
Page Count: 12
  • Download ($30.00)
  • Cite this Item
ε -Approximations for Multidimensional Weighted Location Problems
Preview not available

Abstract

This paper considers the multidimensional weighted minimax location problem, namely, finding a facility location that minimizes the maximal weighted distance to n points. General distance norms are used. An ε -approximate solution is obtained by applying a variant of the Russian method for the solution of Linear Programming. The algorithm has a time complexity of O(n log ε) for fixed dimensionality k. Computational results are presented.

Page Thumbnails

  • Thumbnail: Page 
772
    772
  • Thumbnail: Page 
773
    773
  • Thumbnail: Page 
774
    774
  • Thumbnail: Page 
775
    775
  • Thumbnail: Page 
776
    776
  • Thumbnail: Page 
777
    777
  • Thumbnail: Page 
778
    778
  • Thumbnail: Page 
779
    779
  • Thumbnail: Page 
780
    780
  • Thumbnail: Page 
781
    781
  • Thumbnail: Page 
782
    782
  • Thumbnail: Page 
783
    783