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

作     者：LI Yu XIU NaiHua XU DaChuan 

作者机构：Department of Mathematics Beijing Jiaotong University Department of Applied Mathematics Beijing University of Technology 

基　　金：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) 

出 版 物：《Science China Mathematics》 (中国科学：数学（英文版）)

年 卷 期：2013年第56卷第11期

页      码：2381-2388页

摘      要：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.

主 题 词：approximation algorithm warehouse-retailer network design problem k-median 

学科分类：12[管理学] 1201[管理学-管理科学与工程类] 07[理学] 070104[070104] 070105[070105] 0701[理学-数学类] 

核心收录：

D　O　I：10.1007/s11425-013-4704-z

馆 藏 号：203827438...