Improved local search for universal facility location

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 ) approximation algorithm for this problem based on local search technique.
Document type :
Journal articles
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00950395
Contributor : Frédéric Davesne <>
Submitted on : Friday, June 19, 2015 - 11:26:05 AM
Last modification on : Monday, October 28, 2019 - 10:50:21 AM
Long-term archiving on: Tuesday, April 25, 2017 - 2:14:23 PM

File

UFL_COCOON.pdf
Files produced by the author(s)

Identifiers

Citation

Eric Angel, Kim Thang Nguyen, Damien Regnault. Improved local search for universal facility location. Journal of Combinatorial Optimization, Springer Verlag, 2015, 29 (1), pp.237--246. ⟨10.1007/s10878-014-9711-7⟩. ⟨hal-00950395⟩

Share

Metrics

Record views

174

Files downloads

142