An approximation algorithm for the k-level capacitated facility location problem

Donglei Du (), Xing Wang () and Dachuan Xu ()
Additional contact information
Donglei Du: University of New Brunswick
Xing Wang: Beijing University of Technology
Dachuan Xu: Beijing University of Technology

Journal of Combinatorial Optimization, 2010, vol. 20, issue 4, No 3, 368 pages

Abstract: Abstract We consider the k-level capacitated facility location problem (k-CFLP), which is a natural variant of the classical facility location problem and has applications in supply chain management. We obtain the first (combinatorial) approximation algorithm with a performance factor of $k+2+\sqrt{k^{2}+2k+5}+\varepsilon$ (ε>0) for this problem.

Keywords: Capacitated facility location problem; Approximation algorithm; Local search (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-009-9213-1 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:20:y:2010:i:4:d:10.1007_s10878-009-9213-1

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

DOI: 10.1007/s10878-009-9213-1

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 ().