On the rectangular p‐center problem

Zvi Drezner

Naval Research Logistics (NRL), 1987, vol. 34, issue 2, 229-234

Abstract: The p‐center problem involves finding the best locations for p facilities such that the furthest among n points is as close as possible to one of the facilities. Rectangular (sometimes called rectilinear, Manhattan, or l1) distances are considered. An O(n) algorithm for the 1‐center problem, an O(n) algorithm for the 2‐center problem, and an O(n logn) algorithm for the 3‐center problem are given. Generalizations to general p‐center problems are also discussed.

Date: 1987
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(198704)34:23.0.CO;2-1

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:wly:navres:v:34:y:1987:i:2:p:229-234

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().