[1] YANG K, YANG L, GAO Z. Hub-and-spoke network design problem under uncertainty considering financial and service issues: a two-phase approach[J]. Information Sciences, 2017, 402: 15-34 [2] FARAHANI R Z, HEKMATFAR M, ARABANI A B, et al. Hub location problems: a review of models, classification, techniques and application[J]. Computers & Industrial Engineering, 2013, 64(4): 1096-1109 [3] O'KELLY M E. Network hub structure and resilience[J]. Networks and Spatial Economics, 2015, 15: 235-251 [4] GHAFFARINASAB N, MOTALLEBZADEH A. Hub interdiction problem variants: models and metaheuristic solution algorithms[J]. European Journal of Operational Research, 2018, 267(2): 496-512 [5] SMITH J C, PRINCE M, GEUNES J. Modern network interdiction problems and algorithms[M]. New York: Springer, 2013: 1949-1988. [6] AKSEN D, AKCA S S, ARAS N. A bilevel partial interdiction problem with capacitated facilities and demand outsourcing[J]. Computers & Operations Research, 2014, 41: 346-358 [7] LOSADA C, SCAPARRA M P, CHURCH R L, et al. The stochastic interdiction median problem with disruption intensity levels[J]. Annals of Operations Research, 2012, 201(1): 345-365 [8] LEI T L. Identifying critical facilities in hub-and-spoke networks: a hub interdiction median problem[J]. Geographical Analysis, 2013, 45(2): 105-122 [9] PARVARESH F, HUSSEINI S M, GOLPAYEGANY S A H, et al. Hub network design problem in the presence of disruptions[J]. Journal of Intelligent Manufacturing, 2014, 25(4): 755-774 [10] GHAFFARINASAB N, ATAYI R. An implicit enumeration algorithm for the hub interdiction median problem with fortification[J]. European Journal of Operational Research, 2018, 267(1): 23-39 [11] RAMAMOORTHY P, JAYASWAL S, SINHA A, et al. Multiple allocation hub interdiction and protection problems: model formulations and solution approaches[J]. European Journal of Operational Research, 2018, 270(1): 230-245 [12] CAMPBELL J F, O'KELLY M E. Twenty-five years of hub location research[J]. Transportation Science, 2013, 46(2): 153-169 [13] ADAMS W P, FORRESTER R J. A simple recipe for concise mixed 0-1 linearizations[J]. Operations Research Letters, 2005, 33(1): 55-61 [14] MCCORMICK G P. Computability of global solutions to factorable nonconvex programs: Part I-Convex underestimating problems[J]. Mathematical Programming, 1976, 10(1): 147-175 [15] BEASLEY J E. OR-Library[EB/OL].[2019-01-10]. http://people.brunel.ac.uk/~mastjjb/jeb/orlib/phubinfo.html. [16] EBERY J, KRISHNAMOORTHY M, ERNST A, et al. The capacitated multiple allocation hub location problem: formulations and algorithms[J]. European Journal of Operational Research, 2000, 120(3): 614-631 [17] CHAHARSOOGHI S K, MOMAYEZI F, GHAFFARINASAB N. An adaptive large neighborhood search heuristic for solving the reliable multiple allocation hub location problem under hub disruptions[J]. International Journal of Industrial Engineering Computations, 2017, 8(2): 191-202 [18] IBM. ILOG CPLEX Optimization studio[EB/OL].[2019-01-10]. https://www.ibm.com/products/ilog-cplex-optimization-studio/details. [19] O'KELLY M E. A quadratic integer program for the location of interacting hub facilities[J]. European Journal of Operational Research, 1987, 32(3): 393-404
|