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 Lagrangi...