Approximation algorithm for dynamic facility location problem

Li Zhang and Qiaoliang Li ()
Additional contact information
Li Zhang: Hunan Agricultural University
Qiaoliang Li: Hunan Agricultural University

Journal of Combinatorial Optimization, 2025, vol. 49, issue 3, No 13, 15 pages

Abstract: Abstract 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.

Keywords: Dual-fitting; Greedy augmentation; Dynamic facility location; Approximation algorithm; 90C27; 90C10 (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01282-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:49:y:2025:i:3:d:10.1007_s10878-025-01282-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-025-01282-7

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().