TY - JOUR

T1 - An approximation algorithm for the maximization version of the two level uncapacitated facility location problem

AU - Bumb, Adriana

PY - 2001/11

Y1 - 2001/11

N2 - A polynomial time approximation algorithm for the shifted two level MAX uncapacitated facility location problem (UFLP) problem was described. The problem was based on the technique of independently randomized rounding. The facilities in each level were opened and assigned each demand point to a path along open facilities such that the total profit was maximized when facilities were located on k levels. It was found that even if the facilities were opened independently, the events corresponding to paths being opened became dependent.

AB - A polynomial time approximation algorithm for the shifted two level MAX uncapacitated facility location problem (UFLP) problem was described. The problem was based on the technique of independently randomized rounding. The facilities in each level were opened and assigned each demand point to a path along open facilities such that the total profit was maximized when facilities were located on k levels. It was found that even if the facilities were opened independently, the events corresponding to paths being opened became dependent.

KW - Approximation algorithms

KW - Facility location

KW - Randomized algorithms

UR - http://www.scopus.com/inward/record.url?scp=0035508472&partnerID=8YFLogxK

U2 - 10.1016/S0167-6377(01)00087-6

DO - 10.1016/S0167-6377(01)00087-6

M3 - Article

AN - SCOPUS:0035508472

SN - 0167-6377

VL - 29

SP - 155

EP - 161

JO - Operations Research Letters

JF - Operations Research Letters

IS - 4

ER -