TY - JOUR
T1 - A distance constrained p-facility location problem on the real line
AU - Tamir, Arie
PY - 1994/8
Y1 - 1994/8
N2 - 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.
AB - 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.
KW - Location theory
KW - Minimum cut problems
KW - p-center problems
UR - http://www.scopus.com/inward/record.url?scp=34249767250&partnerID=8YFLogxK
U2 - 10.1007/BF01581145
DO - 10.1007/BF01581145
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:34249767250
VL - 66
SP - 201
EP - 204
JO - Mathematical Programming
JF - Mathematical Programming
SN - 0025-5610
IS - 1-3
ER -