The conditional p‐center problem in the plane

R. Chen*, Y. Handler

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


An algorithm is given for the conditional p‐center problem, namely, the optimal location of one or more additional facilities in a region with given demand points and one or more preexisting facilities. The solution dealt with here involves the minimax criterion and Euclidean distances in two‐dimensional space. The method used is a generalization to the present conditional case of a relaxation method previously developed for the unconditional p‐center problems. Interestingly, its worst‐case complexity is identical to that of the unconditional version, and in practice, the conditional algorithm is more efficient. Some test problems with up to 200 demand points have been solved. © 1993 John Wiley & Sons, Inc.

Original languageEnglish
Pages (from-to)117-127
Number of pages11
JournalNaval Research Logistics
Issue number1
StatePublished - Feb 1993


Dive into the research topics of 'The conditional p‐center problem in the plane'. Together they form a unique fingerprint.

Cite this