Approximation algorithm for dynamic facility location problem

In this paper, we consider dynamic facility location problem with unit demand (DFLPUD). We propose a 1.52-approximation algorithm that skillfully integrates dual-fitting and greedy augmentation schemes. Our algorithmic framework begins by formulating DFLPUD as a set covering linear integer programmi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of combinatorial optimization Ročník 49; číslo 3; s. 48
Hlavní autoři: Zhang, Li, Li, Qiaoliang
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.04.2025
Springer Nature B.V
Témata:
Algorithms
Approximation
Combinatorics
Convex and Discrete Geometry
Integer programming
Linear programming
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Site selection
Theory of Computation
Dual-fitting
Greedy augmentation
90C10
Dynamic facility location
90C27
Approximation algorithm
ISSN:1382-6905, 1573-2886
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we consider dynamic facility location problem with unit demand (DFLPUD). We propose a 1.52-approximation algorithm that skillfully integrates dual-fitting and greedy augmentation schemes. Our algorithmic framework begins by formulating DFLPUD as a set covering linear integer programming problem. Then we scale the opening cost of all facilities and use the solution of dual-fitting algorithm to seed a local search to yield an improved performance guarantee 1.52. To the best of our knowledge, this is the best known approximation ratio for DFLPUD.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1382-6905
1573-2886
DOI:10.1007/s10878-025-01282-7