ε-Approximations for Multidimensional Weighted Location Problems

Zvi Drezner and Bezalel Gavish
Additional contact information
Zvi Drezner: California, State University, Fullerton, California
Bezalel Gavish: The University of Rochester, Rochester, New York

Operations Research, 1985, vol. 33, issue 4, 772-783

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.

Keywords: 185 facility-location problems; 632 algorithms: heuristic (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.33.4.772 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:33:y:1985:i:4:p:772-783

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().