Indexed by：
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.
Keyword：
Reprint Author's Address：
Source ：
SCIENCE CHINA-MATHEMATICS
ISSN： 1674-7283
Year： 2013
Issue： 11
Volume： 56
Page： 2381-2388
1 . 4 0 0
JCR@2022
ESI Discipline： MATHEMATICS;
JCR Journal Grade：2
CAS Journal Grade：3
Cited Count：
WoS CC Cited Count： 2
SCOPUS Cited Count： 2
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 0
Affiliated Colleges：
