Improved Local Search for Universal Facility Location - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Improved Local Search for Universal Facility Location


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.
Fichier principal
Vignette du fichier
UFL_COCOON.pdf (159.95 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00832197 , version 1 (28-11-2013)



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⟩
54 View
122 Download



Gmail Facebook Twitter LinkedIn More