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

Cited literature [8 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00832197
Contributor : Frédéric Davesne <>
Submitted on : Thursday, November 28, 2013 - 10:12:07 PM
Last modification on : Monday, October 28, 2019 - 10:50:21 AM
Long-term archiving on: Monday, March 3, 2014 - 1:55:20 PM

File

UFL_COCOON.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Eric Angel, Kim Thang Nguyen, Damien Regnault. Improved Local Search for Universal Facility Location. 19th Annual International Computing and Combinatorics Conference (COCOON'13), Jun 2013, Hangzhou, China. pp.316--324, ⟨10.1007/978-3-642-38768-5_29⟩. ⟨hal-00832197⟩

Share

Metrics

Record views

111

Files downloads

201