An approximation algorithm for the k-median warehouse-retailer network design problem  

作　　者：LI Yu XIU NaiHua XU DaChuan 

机构地区：[1]Department of Mathematics, Beijing Jiaotong University [2]Department of Applied Mathematics, Beijing University of Technology

出　　处：《Science China Mathematics》2013年第11期2381-2388,共8页中国科学：数学（英文版）

基　　金：supported by National Basic Research Program of China(973 Program)(Grant No.2010CB732501);National Natural Science Foundation of China(Grant No.11071268);China Scholarship Council Scientific Research Common Program of Beijing Municipal Commission of Education(Grant No.KM201210005033)

摘　　要：We study the generalizedk-median version of the warehouse-retailer network design problem(kWRND).We formulate the k-WRND as a binary integer program and propose a 6-approximation randomized algorithm based on Lagrangian relaxation.We study the generalized k-median version of the warehouse-retailer network design problem （k- WRND）. We formulate the k-WRND as a binary integer program and propose a 6-approximation randomized algorithm based on Lagrangian relaxation.

关 键 词：approximation algorithm warehouse-retailer network design problem k-median 

分 类 号：O221[理学—运筹学与控制论] O157.5[理学—数学]