In this article we propose, for any ε > 0, a 2(1 + ε)-approximation algorithm for a facility location problem with stochastic demands. At open facilities, inventory is kept such that arriving requests find a zero inventory with (at most) some pre-specified probability. The incurred costs are the expected transportation costs from the demand points to the facilities, the operating costs of the facilities and the investment in inventory
We analyze the problem of optimal location of a set of facilities in the presence of stochastic dema...
We consider the kk-level stochastic facility location problem. For this, we present an LP rounding a...
Weconsider ametric uncapacitated facility locationprob-lem where we must assign each customer to a f...
In this article we propose, for any $\varepsilon$ > 0, a 2(1 + $\varepsilon$)-approximation algorith...
In this article we propose, for any > 0, a 2(1 + )-approximation algorithm for a facility locatio...
We propose a 2-approximation algorithm for a facility location problem with stochastic demands. At o...
AbstractIn this article we focus on approximation algorithms for facility location problems with sub...
In this article we focus on approximation algorithms for facility location problems with subadditive...
In this article we focus on approximation algorithms for facility location problems with subadditive...
In the k-level facility location problem (FLP), we are given a set of facilities, each associated wi...
We present new approximation algorithms for several facility lo-cation problems. In each facility lo...
In the k-level uncapacitated facility location problem, we have a set of demand points where clients...
We analyze the problem of optimal location of a set of facilities in the presence of stochastic dema...
We consider the kk-level stochastic facility location problem. For this, we present an LP rounding a...
Weconsider ametric uncapacitated facility locationprob-lem where we must assign each customer to a f...
In this article we propose, for any $\varepsilon$ > 0, a 2(1 + $\varepsilon$)-approximation algorith...
In this article we propose, for any > 0, a 2(1 + )-approximation algorithm for a facility locatio...
We propose a 2-approximation algorithm for a facility location problem with stochastic demands. At o...
AbstractIn this article we focus on approximation algorithms for facility location problems with sub...
In this article we focus on approximation algorithms for facility location problems with subadditive...
In this article we focus on approximation algorithms for facility location problems with subadditive...
In the k-level facility location problem (FLP), we are given a set of facilities, each associated wi...
We present new approximation algorithms for several facility lo-cation problems. In each facility lo...
In the k-level uncapacitated facility location problem, we have a set of demand points where clients...
We analyze the problem of optimal location of a set of facilities in the presence of stochastic dema...
We consider the kk-level stochastic facility location problem. For this, we present an LP rounding a...
Weconsider ametric uncapacitated facility locationprob-lem where we must assign each customer to a f...