On weighted rectilinear 2-center and 3-center problems

https://doi.org/10.1016/0020-0255(91)90050-5Get rights and content

Abstract

Given n demand points with positive weights on the plane, the weighted rectilinear m-center problem is to determine m service points so as to minimize the maximum of weighted rectilinear distances from demand points to their respective nearest service points. In this paper, we propose O(n) algorithms for the weighted rectilinear 2-center and 3-center decision problems, and O(n log n) algorithms for the weighted rectilinear 2-center and 3-center optimization problems.

References (11)

  • Z. Drezner et al.

    Layout facilities with some fixed points

    Computers and Operations Res.

    (1985)
  • Z. Drezner

    The planar two-center and two-median problem

    Transportation Sci.

    (1984)
  • Z. Drezner

    The p-center problem—Heuristic and optimal algorithms

    J. Operational Res. Soc.

    (1984)
  • Z. Drezner

    On the rectangular p-center problem

    Naval Research Logistics

    (1987)
  • Z. Drezner et al.

    Single facility lp-distance minimax location

    SIAM J. Algebraic and Discrete Methods

    (September 1980)
There are more references available in the full text version of this article.

Cited by (4)

This research work was partially supported by a grant from the National Science Council of the Republic of China under grant NSC-77-0408-E007-03.

View full text