[1]Bertsimas D, Sim M. Robust discrete optimization and network flows [J]. Mathematical Programming Series B, 2003, 98(13): 4971. [2]Carrizosa E, Nickel S. Robust facility location [J]. Mathematical Methods in Operations Research, 2003, 58(2): 331349. [3]Ricciardi N, Tadei R, Grosso A. Optimal facility location with random throughput costs [J]. Computers and Operations Research, 2002, 29(6): 593607. [4]Snyder L V, Daskin M S. Reliability models for facility location: The expected failure cost case [J]. Transportation Science, 2005, 39(3): 400416. [5]Lim C, Smith J C. Algorithms for discrete and continuous multicommodity flow network interdiction problems [J]. IIE Transactions, 2007, 39(1): 1526. [6]Berman O, Krass D, Menezes M B C. Locating facilities in the presence of disruptions and incomplete information [J]. Decision Sciences, 2009, 40(4): 845868. [7]Li X P, Quyang Y F. A continuum approximation approach to reliable facility location design under correlated probabilistic disruptions [J]. Transportation Research Part B: Methodological, 2010, 44(4):535548. [8]朱伟,徐克林,周炳海,等.基于贪婪启发式的多期多目标动态网络选址[J]. 上海交通大学学报, 2012, 46(2): 269275. ZHU Wei, XU Kelin, ZHOU Binghai, et al. Study on multistage multi objective network location problem based on greedy heuristic algorithm [J]. Journal of Shanghai Jiaotong University, 2012, 46(2): 269275. [9]Shen M, Zhan R, Zhang J. The reliable facility location problem: Formulations, heuristics, and approximation algorithms [J]. INFORMS Journal on Computing, 2011, 23 (3):470482. [10]Fisher M L. An applications oriented guide to Lagrangian relaxation [J]. Interfaces, 1985, 15(2): 1021. [11]Cui T, Ouyang Y F, Shen Z J M. Reliable facility location design under the risk of disruptions [J]. Operations Research, 2010, 58(4): 9981011. |