An approximation algorithm for the k-median warehouse-retailer network design problem |
| |
| Authors: | Yu Li NaiHua Xiu DaChuan Xu |
| |
| Institution: | 1. Department of Mathematics, Beijing Jiaotong University, Beijing, 100044, China
2. Department of Applied Mathematics, Beijing University of Technology, Beijing, 100124, China
|
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 CNKI SpringerLink 等数据库收录！ |
|
