An Algorithm for the p -Center Problem in the Plane

James Vijay
Additional contact information
James Vijay: Clinical Systems, Shands Teaching Hospital, Gainesville, Florida

Transportation Science, 1985, vol. 19, issue 3, 235-245

Abstract: The problem of locating p facilities to service m demand points in a plane, such that each demand point is as close as possible to some facility, is considered. An algorithm based on geometry is given, and some computational results presented. Extensions to the weighted case, the surface of a sphere, and the rectilinear norm are also provided.

Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.19.3.235 (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:ortrsc:v:19:y:1985:i:3:p:235-245

Access Statistics for this article

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