文献检索-宁波市创意产业特色资源库

限定检索结果

An approximation algorithm for the k-median warehouse-retailer network design problem: 收藏
分享
引用; 《Science China Mathematics》2013年第11期56卷 2381-2388页; 作者：LI Yu XIU NaiHua XU DaChuanDepartment of Mathematics Beijing Jiaotong University Department of Applied Mathematics Beijing University of Technology; 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 Lagrangi...; 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.; 来源：详细信息评论

限定检索结果