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

Science China Mathematics（2013）

引用 2|浏览6

暂无评分

摘要

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

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要