Melo M T, Nickel S, Saldanha-da-Gama F. Facility location and supply chain management: A review[J]. European Journal of Operational Research, 2009, 196: 401-412.
[2]
Drezner Z, Hamacher H W. Facility location: apploications and theory[M]. New York:Springer, 2004.
[3]
Klose A,Drexl A, Facility location models for distribution system design[J]. European Journal of Operational Research, 2005,162: 4-29.
[4]
Revelle C S, Eiselt H A, Daskin M S. A bible- ography for some fundamental problem categories in discrete location science[J]. European Journal of Operational Research,2008,184:817-848.
[5]
Kuehn A, Hamburger M.A heuristic program for location warehouses[J].Management Science, 1963, 6: 643-666.
[6]
Jain A K, Murty M N, Flynn P J. Data clustering: a review[J]. ACM Computing Surveys, 1999, 31(3), 264-323.
[7]
Fasulo D. An analysis of recent work on clustering algorithms. Technical Report UW-CSE-01-03-02,University of Washington, 1999.
Canel C, Khumawal B M, Law J, et al, An algorithm for the capacitated, multi-commodity multi-period facility location problem[J]. Computers & Operations Research, 2001,28(5):411-427.
Ghosh J. Scalable clustering methods for data mining[M]//Ye N. Handbook of data mining. Lawrence Erlbaum, 2002.
[12]
Shi Henghua, He Jingsha, Xu Xin, A clustering algorithm for the placement of measurement nodes in a measurement network[J]. Journal of Computational Information Systems, 2008, 4(6), 2539-2546.
[13]
Zahn C T.Graph-theoretic methods for detecting and describing gestalt clusters[J]. IEEE trans Computer, 1971,20:68-86.
[14]
Lee L H, Chew E P. A dynamic joint replenishment policy with auto-correlated demand[J]. European Journal of Operational Research.2005,165: 729-747.
[15]
Tsai C Y,Tsai C Y, Huang P W. An association clustering algorithm for can-order policies in the joint replenishment problem[J]. International Journal of Production Economics, 2009,117:30-41.
