A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
An 0.828-approximation algorithm for the uncapacitated facility location problem
1999
Discrete Applied Mathematics
The uncapacitated facility location problem in the following formulation is considered: where I and J are ÿnite sets, and bij, ci¿0 are rational numbers. Let Z * denote the optimal value of the problem and let ZR = j∈J mini∈I bij − i∈I ci. Cornuejols et al. (Ann. Discrete Math. 1 (1977) 163-178) prove that for the problem with the additional cardinality constraint |S|6K, a simple greedy algorithm ÿnds a feasible solution S such that (Z(S) − ZR)=(Z * − ZR)¿1 − e −1 ≈ 0:632. We suggest a
doi:10.1016/s0166-218x(99)00103-1
fatcat:dyvubpflozeczjx2nrc4bflnym