Approximation algorithm for k-level hard capacitated facility location problem
نویسندگان
چکیده
In this paper, we consider k-level hard capacitated facility location problem.
منابع مشابه
A New Hybrid Algorithm to Optimize Stochastic-fuzzy Capacitated Multi-Facility Location-allocation Problem
Facility location-allocation models are used in a widespread variety of applications to determine the number of required facility along with the relevant allocation process. In this paper, a new mathematical model for the capacitated multi-facility location-allocation problem with probabilistic customer's locations and fuzzy customer’s demands under the Hurwicz criterion is proposed. Thi...
متن کاملThe Capacitated K - Center Problem 1
The capacitated K-center problem is a fundamental facility location problem, where we are asked to locate K facilities in a graph, and to assign vertices to facilities, so as to minimize the maximum distance from a vertex to the facility to which it is assigned. Moreover, each facility may be assigned at most L vertices. This problem is known to be NP-hard. We give polynomial time approximation...
متن کاملApproximation algorithms for the capacitated k-facility location problems
We study the capacitated k-facility location problem, in which we are given a set of clients with demands, a set of facilities with capacities and a constant number k. It costs fi to open facility i, and cij for facility i to serve one unit of demand from client j. The objective is to open at most k facilities serving all the demands and satisfying the capacity constraints while minimizing the ...
متن کاملThe Capacitated K-Center Problem
The capacitated K-center problem is a fundamental facility location problem, where we are asked to locate K facilities in a graph, and to assign vertices to facilities, so as to minimize the maximum distance from a vertex to the facility to which it is assigned. Moreover, each facility may be assigned at most L vertices. This problem is known to be NP-hard. We give polynomial time approximation...
متن کاملConstant factor Approximation Algorithms for Uniform Hard Capacitated Facility Location Problems: Natural LP is not too bad
Abstract. In this paper, we study the uniform hard capacitated k facility location problem (CkFLP) and knapsack median problem (CKM). Natural LP of both the problems have an unbounded integrality gap. Byrka et al. in [5] present an (O(1/ǫ)) for CkFLP violating cpapcities by a factor of (2 + ǫ). However, the proofs in [5] do not seem to work. In this paper, we first raise the issues in [5] and t...
متن کامل