A primal-dual approximation algorithm for the k-level stochastic facility location problem
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Improved approximation algorithms for the robust fault-tolerant facility location problem
Information Processing Letters
An approximation algorithm for the k-level stochastic facility location problem
Operations Research Letters
| Hi-index | 0.00 |
Answering an open question published in Operations Research (54, 73–91, 2006) in the area of network design and logistic optimization, we present the first constant-factor approximation algorithms for the problem combining facility location and cable installation in which capacity constraints are imposed on both facilities and cables. We study the problem of designing a minimum cost network to serve client demands by opening facilities for service provision and installing cables for service shipment. Both facilities and cables have capacity constraints and incur buy-at-bulk costs. This Max SNP-hard problem arises in diverse applications and is shown in this paper to admit a combinatorial 19.84-approximation algorithm of cubic running time. This is achieved by an integration of primal-dual schema, Lagrangian relaxation, demand clustering and bi-factor approximation. Our techniques extend to several variants of this problem, which include those with unsplitable demands or requiring network connectivity, and provide constant-factor approximate algorithms in strongly polynomial time.