You are not currently logged in.
Access JSTOR through your library or other institution:
ε -Approximations for Multidimensional Weighted Location Problems
Zvi Drezner and Bezalel Gavish
Vol. 33, No. 4 (Jul. - Aug., 1985), pp. 772-783
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/170711
Page Count: 12
You can always find the topics here!Topics: Ellipsoids, Algorithms, Mathematical problems, Minimax, Linear programming, Customers, Computer networking, Optimal solutions, Hyperplanes, Mathematics
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
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.
Operations Research © 1985 INFORMS