An approximation algorithm for the k-level stochastic facility location problem

Authors:
Zhen Wang;Donglei Du;Adriana F. Gabor;Dachuan Xu
Affiliations:
Department of Applied Mathematics, Beijing University of Technology, 100 Pingleyuan, Chaoyang District, Beijing 100124, PR China;Faculty of Business Administration, University of New Brunswick, Fredericton, NB, Canada E3B 5A3;Department of Econometrics, Erasmus School of Economics, Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands;Department of Applied Mathematics, Beijing University of Technology, 100 Pingleyuan, Chaoyang District, Beijing 100124, PR China
Venue:
Operations Research Letters
Year:
2010

Citing 20
Cited 3

Approximation algorithms for facility location problems (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms

Journal of Algorithms
A 3-approximation algorithm for the k-level uncapacitated facility location problem

Information Processing Letters
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation

Journal of the ACM (JACM)
A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem

APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP

Journal of the ACM (JACM)
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem

SIAM Journal on Computing
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem

SIAM Journal on Discrete Mathematics
Facility location and the analysis of algorithms through factor-revealing programs

Facility location and the analysis of algorithms through factor-revealing programs
Stochastic Transportation-Inventory Network Design Problem

Operations Research
A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem

Mathematics of Operations Research
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems

Mathematical Programming: Series A and B
Approximating the two-level facility location problem via a quasi-greedy approach

Mathematical Programming: Series A and B
Approximation Algorithms for Metric Facility Location Problems

SIAM Journal on Computing
An approximation scheme for stochastic linear programming and its application to stochastic integer programs

Journal of the ACM (JACM)
Approximation algorithms for stochastic and risk-averse optimization

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design

Algorithmica
A new approximation algorithm for the multilevel facility location problem

Discrete Applied Mathematics
An Efficient Greedy Heuristic for Warehouse-Retailer Network Design Optimization

Transportation Science
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

SIAM Journal on Computing

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
Erratum: Erratum to: "An approximation algorithm for the k-level stochastic facility location problem" [Oper. Res. Lett. 38 (2010) 386-389]

Operations Research Letters
Survey: Hierarchical facility location problem: Models, classifications, techniques, and applications

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the k-level stochastic facility location problem. For this, we present an LP rounding algorithm that is 3-approximate. This result is achieved by a novel integer linear programming formulation that exploits the stochastic structure.