Vijay, James An algorithm for the p-center problem in the plane. (English) Zbl 0608.90020 Transp. Sci. 19, 235-245 (1985). 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. Cited in 10 Documents MSC: 90B05 Inventory, storage, reservoirs Keywords:p-center problem in the plane; facility location; p facilities; m demand points; computational results; weighted case; surface of a sphere; rectilinear norm × Cite Format Result Cite Review PDF Full Text: DOI