New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem
نویسندگان
چکیده
منابع مشابه
Approximation algorithms for Capacitated Facility Location Problem with Penalties
In this paper, we address the problem of capacitated facility location problem with penalties (CapFLPP) paid per unit of unserved demand. In case of uncapacitated FLP with penalties demands of a client are either entirely met or are entirely rejected and penalty is paid. In the uncapacitated case, there is no reason to serve a client partially. Whereas, in case of CapFLPP, it may be beneficial ...
متن کامل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 ...
متن کاملImproved Approximation Algorithms for Capacitated Facility Location Problems
In a surprising result, Korupolu, Plaxton, and Rajaraman [13] showed that a simple local search heuristic for the capacitated facility location problem (CFLP) in which the service costs obey the triangle inequality produces a solution in polynomial time which is within a factor of 8+ ǫ of the value of an optimal solution. By simplifying their analysis, we are able to show that the same heuristi...
متن کاملApproximation Algorithms for Soft-Capacitated Connected Facility Location Problems
1 Abbreviations and Notations 2
متن کاملLP-based Approximation Algorithms for Capacitated Facility Location
There has been a great deal of recent work on approximation algorithms for facility location problems [9]. We consider the capacitated facility location problem with hard capacities. We are given a set of facilities, F , and a set of clients D in a common metric space. Each facility i has a facility opening cost fi and capacity ui that specifies the maximum number of clients that may be assigne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2015
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-015-0012-z