A simple heuristic for the p-centre problem

We describe a simple heuristic for determining the p-centre of a finite set of weighted points in an arbitrary metric space. The computational effort is O( np) for an n-point set. We show that the ratio of the objective function value of the heuristic solution to that of the optimum is bounded by mi...

Full description

Saved in:
Bibliographic Details
Published inOperations research letters Vol. 3; no. 6; pp. 285 - 288
Main Authors Dyer, M.E, Frieze, A.M
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.01.1985
Elsevier
Subjects
Applied sciences
Exact sciences and technology
heuristic solution
Miscellaneous
Operational research and scientific management
Operational research. Management science
p-centre problem
p-centre problem
heuristic solution
Location problem
Heuristic method
Online AccessGet full text

Cover

More Information
Summary:We describe a simple heuristic for determining the p-centre of a finite set of weighted points in an arbitrary metric space. The computational effort is O( np) for an n-point set. We show that the ratio of the objective function value of the heuristic solution to that of the optimum is bounded by min(3, 1 + α), where α is the maximum weight divided by the minimum weight of points in the set.
ISSN:0167-6377
1872-7468
DOI:10.1016/0167-6377(85)90002-1