Distance constrained p-facility location problem on the real line

Research output: Contribution to journalArticlepeer-review


Let V = {v1,..., vn} be a set of n points on the real line (existing facilities). The problem considered is to locate p new point facilities, F1,..., Fp, in V while satisfying distance constraints between pairs of existing and new facilities and between pairs of new facilities. For i = 1,..., p, j = 1,..., n, the cost of locating Fi at point vj is cij. The objective is to minimize the total cost of setting up the new facilities. We present an O (p3n2 log n) algorithm to solve the model.

Original languageEnglish
Pages (from-to)201-204
Number of pages4
JournalMathematical Programming
Issue number2
StatePublished - 7 Sep 1994


Dive into the research topics of 'Distance constrained p-facility location problem on the real line'. Together they form a unique fingerprint.

Cite this