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

被引：16
|
作者：
Du, Donglei [2 ]
Wang, Xing [1 ]
Xu, Dachuan [1 ]
机构：
[1] Beijing Univ Technol, Dept Appl Math, Beijing 100124, Peoples R China
[2] Univ New Brunswick, Fac Business Adm, Fredericton, NB E3B 5A3, Canada
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2010年 / 20卷 / 04期
基金：
加拿大自然科学与工程研究理事会;
关键词：
Capacitated facility location problem; Approximation algorithm; Local search;
D O I：
10.1007/s10878-009-9213-1
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
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 + root k(2) + 2k + 5 + epsilon (epsilon > 0) for this problem.
引用
下载
收藏
页码：361 / 368
页数：8
相关论文
共 50 条
12345