Primal–dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach

The main contribution of this work is to propose a primal–dual combinatorial 3(1+ε)-approximation algorithm for the two-level facility location problem (2-LFLP) by exploring the approximation oracle concept. This result improves the previous primal–dual 6-approximation algorithm for the multilevel f...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Theoretical computer science Ročník 562; s. 213 - 226
Hlavní autori: Wu, Chenchen, Du, Donglei, Xu, Dachuan
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 2015
Predmet:
Algorithms
Approximation
Approximation algorithm
Combinatorial analysis
Computer simulation
Facility location problem
Mathematical analysis
Multilevel
Operations research
Primal–dual algorithm
Site selection
Facility location problem
Approximation algorithm
Primal–dual algorithm
ISSN:0304-3975, 1879-2294
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The main contribution of this work is to propose a primal–dual combinatorial 3(1+ε)-approximation algorithm for the two-level facility location problem (2-LFLP) by exploring the approximation oracle concept. This result improves the previous primal–dual 6-approximation algorithm for the multilevel facility location problem, and also matches the previous primal–dual approximation ratio for the single-level facility location problem. One of the major merits of primal–dual type algorithms is their easy adaption to other variants of the facility location problems. As a demonstration, our primal–dual approximation algorithm can be easily adapted to several variants of the 2-LFLP, including models with stochastic scenario, dynamically arrived demands, and linear facility cost.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2014.09.045