Improved local search for universal facility location
Eric Angel,
Nguyen Kim Thang () and
Damien Regnault
Additional contact information
Eric Angel: University of Evry Val d’Essonne
Nguyen Kim Thang: University of Evry Val d’Essonne
Damien Regnault: University of Evry Val d’Essonne
Journal of Combinatorial Optimization, 2015, vol. 29, issue 1, No 15, 237-246
Abstract:
Abstract We consider the universal facility location problem in which the goal is to assign clients to facilities in order to minimize the sum of connection and facility costs. The connection cost is proportional to the distance each client has to travel to its assigned facility, whereas the cost of a facility is a non-decreasing function depending on the number of clients assigned to the facility. This model generalizes several variants of facility location problems. We present a $$(5.83 + \epsilon )$$ ( 5.83 + ϵ ) approximation algorithm for this problem based on local search technique.
Keywords: Local Search; Polynomial Time; Facility Location; Approximation Ratio; Transportation Cost (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9711-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:29:y:2015:i:1:d:10.1007_s10878-014-9711-7
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1007/s10878-014-9711-7
Access Statistics for this article
Journal of Combinatorial Optimization is currently edited by Thai, My T.
More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().