{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T12:18:05Z","timestamp":1768738685346,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,5,17]],"date-time":"2017-05-17T00:00:00Z","timestamp":1494979200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001316","name":"University of Kent","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001316","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s10479-017-2517-0","type":"journal-article","created":{"date-parts":[[2017,5,17]],"date-time":"2017-05-17T09:18:30Z","timestamp":1495012710000},"page":"159-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods"],"prefix":"10.1007","volume":"272","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6410-0105","authenticated-orcid":false,"given":"Nader","family":"Azizi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,17]]},"reference":[{"issue":"2\u20133","key":"2517_CR1","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/S0377-2217(97)00286-5","volume":"106","author":"S Abdinnour-Helm","year":"1998","unstructured":"Abdinnour-Helm, S. (1998). A hybrid heuristic for the uncapacitated hub location problem. European Journal of Operational Research, 106(2\u20133), 489\u2013499.","journal-title":"European Journal of Operational Research"},{"key":"2517_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","volume":"190","author":"S Alumur","year":"2008","unstructured":"Alumur, S., & Kara, B. Y. (2008). Network hub location problems: The state of the art. European Journal of Operational Research, 190, 1\u201321.","journal-title":"European Journal of Operational Research"},{"key":"2517_CR3","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.trb.2015.02.006","volume":"77","author":"Y An","year":"2015","unstructured":"An, Y., Zhang, Y., & Zeng, B. (2015). The reliable hub-and-spoke design problem: Models and algorithms. Transportation Research Part B, 77, 103\u2013122.","journal-title":"Transportation Research Part B"},{"key":"2517_CR4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10479-012-1146-x","volume":"210","author":"N Azad","year":"2012","unstructured":"Azad, N., Saharidis, G. K. D., Davoudpour, H., Malekly, H., & Yektamaram, S. A. (2012). Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach. Annals of Operations Research, 210, 125\u2013163.","journal-title":"Annals of Operations Research"},{"key":"2517_CR5","unstructured":"Azizi, N., Chauhan, S., & Vidyarthid, N. (2017). Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion. Annals of Operations Research (forthcoming)."},{"key":"2517_CR6","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/j.cor.2014.05.012","volume":"65","author":"N Azizi","year":"2016","unstructured":"Azizi, N., Chauhan, S., Salhi, S., & Vidyarthid, N. (2016). The impact of hub failure in hub-and-spoke networks: Mathematical formulations and solution techniques. Computers and Operations Research, 65, 174\u2013188.","journal-title":"Computers and Operations Research"},{"key":"2517_CR7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10107-015-0891-4","volume":"151","author":"P Bonami","year":"2015","unstructured":"Bonami, P., Lodi, A., Tramontani, A., & Wiese, S. (2015). On mathematical programming with indicator constraints. Mathematical Programming, 151, 191\u2013223.","journal-title":"Mathematical Programming"},{"issue":"1","key":"2517_CR8","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/trsc.1080.0233","volume":"43","author":"RS Camargo","year":"2009","unstructured":"Camargo, R. S., de Miranda, G, Jr., & Luna, H. P. (2009). Benders decomposition for the hub location problems with economies of scale. Transportation Science, 43(1), 86\u201397.","journal-title":"Transportation Science"},{"key":"2517_CR9","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(94)90318-2","volume":"72","author":"JF Campbell","year":"1994","unstructured":"Campbell, J. F. (1994). Integer programming formulations of discrete hub location problems. European Journal of Operational Research, 72, 387\u2013405.","journal-title":"European Journal of Operational Research"},{"key":"2517_CR10","doi-asserted-by":"crossref","first-page":"1540","DOI":"10.1287\/mnsc.1050.0406","volume":"51","author":"JF Campbell","year":"2005","unstructured":"Campbell, J. F., Ernst, A. T., & Krishnamurthy, M. (2005). Hub arc location problems: Part I-introduction and results. Management Science, 51, 1540\u20131555.","journal-title":"Management Science"},{"key":"2517_CR11","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/trsc.1120.0410","volume":"46","author":"JF Campbell","year":"2012","unstructured":"Campbell, J. F., & O\u2019Kelly, M. E. (2012). Twenty-five years of hub location research. Transportation Science, 46, 153\u2013169.","journal-title":"Transportation Science"},{"key":"2517_CR12","unstructured":"\u00c7etiner, S. (2003). An iterative hub location and routing problem for postal delivery systems. Master\u2019s thesis, Department of Industrial Engineering, Middle East Technical University, Ankara, Turkey."},{"key":"2517_CR13","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1016\/j.orl.2004.03.005","volume":"32","author":"W Chaovalitwongse","year":"2004","unstructured":"Chaovalitwongse, W., Pardalos, P., & Prokopyev, O. A. (2004). A new linearization technique multi-quadratic 0\u20131 programming problems. Operations Research Letters, 32, 517\u2013522.","journal-title":"Operations Research Letters"},{"issue":"3","key":"2517_CR14","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/s00291-008-0159-y","volume":"31","author":"I Contreras","year":"2009","unstructured":"Contreras, I., Diaz, J. A., & Marin, A. (2009). Lagrangean relaxation for the capacitated hub single assignment. OR Spectrum, 31(3), 485\u2013505.","journal-title":"OR Spectrum"},{"key":"2517_CR15","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1287\/trsc.1110.0398","volume":"46","author":"I Contreras","year":"2012","unstructured":"Contreras, I., Cordeau, J. F., & Laporte, G. (2012). Exact solution of large-scale hub location problems with multiple capacity levels. Transportation Science, 46, 439\u2013459.","journal-title":"Transportation Science"},{"key":"2517_CR16","volume-title":"Location science","author":"I Contreras","year":"2015","unstructured":"Contreras, I. (2015). Hub location problems. In G. Laporte, S. Nickel, & F. Saldanha-da-Gama (Eds.), Location science. Berlin: Springer."},{"issue":"12","key":"2517_CR17","doi-asserted-by":"crossref","first-page":"3128","DOI":"10.1016\/j.cor.2008.11.014","volume":"36","author":"HA Eiselt","year":"2009","unstructured":"Eiselt, H. A., & Marianov, V. (2009). A conditional p-hub location problem with attraction functions. Computers and Operations Research, 36(12), 3128\u20133135.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"2517_CR18","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1287\/ijoc.1090.0335","volume":"22","author":"S Elhedhli","year":"2010","unstructured":"Elhedhli, S., & Wu, H. (2010). A Lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion. INFORMS Journal of Computing, 22(2), 282\u2013296.","journal-title":"INFORMS Journal of Computing"},{"key":"2517_CR19","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0966-8349(96)00011-3","volume":"4","author":"AT Ernst","year":"1996","unstructured":"Ernst, A. T., & Krishnamoorthy, M. (1996). Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science, 4, 139\u2013154.","journal-title":"Location Science"},{"issue":"2","key":"2517_CR20","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.10.2.149","volume":"10","author":"AT Ernst","year":"1998","unstructured":"Ernst, A. T., & Krishnamoorthy, M. (1998). An exact solution approach based on shortest-paths for p-hub median problems. INFORMS Journal on Computing, 10(2), 149\u2013162.","journal-title":"INFORMS Journal on Computing"},{"key":"2517_CR21","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1018994432663","volume":"86","author":"AT Ernst","year":"1999","unstructured":"Ernst, A. T., & Krishnamoorthy, M. (1999). Solution algorithms for the capacitated single allocation hub location problem. Annals of Operations Research, 86, 141\u2013159.","journal-title":"Annals of Operations Research"},{"key":"2517_CR22","doi-asserted-by":"crossref","unstructured":"Kennedy, J., & Eberhart R. (1995). Particle swarm optimization. In Proceedings of the IEEE international conference on neural network, Perth, Australia. IEEE Service Centre Piscataway NJ, 1942\u20131948.","DOI":"10.1109\/ICNN.1995.488968"},{"key":"2517_CR23","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1111\/j.1538-4632.2009.00755.x","volume":"41","author":"H Kim","year":"2009","unstructured":"Kim, H., & O\u2019Kelly, M. E. (2009). Reliable p-hub location problems in telecommunication networks. Geographical Analysis, 41, 283\u2013306.","journal-title":"Geographical Analysis"},{"issue":"1","key":"2517_CR24","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ejor.2006.06.056","volume":"182","author":"J Kratica","year":"2007","unstructured":"Kratica, J., Stanimirovic, Z., Tosic, D., & Filipovic, V. (2007). Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem. European Journal of Operational Research, 182(1), 15\u201328.","journal-title":"European Journal of Operational Research"},{"key":"2517_CR25","doi-asserted-by":"crossref","first-page":"2791","DOI":"10.1016\/j.cor.2006.12.013","volume":"35","author":"B Liu","year":"2008","unstructured":"Liu, B., Wang, L., & Jin, Y. (2008). An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers. Computers and Operations Research, 35, 2791\u20132806.","journal-title":"Computers and Operations Research"},{"key":"2517_CR26","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1287\/trsc.20.2.92","volume":"20","author":"MEA O\u2019Kelly","year":"1986","unstructured":"O\u2019Kelly, M. E. A. (1986). The location of interacting hub facilities. Transportation Science, 20, 92\u2013105.","journal-title":"Transportation Science"},{"key":"2517_CR27","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(87)80007-3","volume":"32","author":"MEA O\u2019Kelly","year":"1987","unstructured":"O\u2019Kelly, M. E. A. (1987). Quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research, 32, 393\u2013404.","journal-title":"European Journal of Operational Research"},{"key":"2517_CR28","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/0377-2217(95)00100-X","volume":"94","author":"D Skorin-Kapov","year":"1996","unstructured":"Skorin-Kapov, D., Skorin-Kapov, J., & O\u2019Kelly, M. (1996). Tight linear programming relaxations of uncapacitated p-hub median problems. European Journal of Operational Research, 94, 582\u2013593.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2517_CR29","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1080\/0740817X.2015.1067735","volume":"48","author":"LV Snyder","year":"2016","unstructured":"Snyder, L. V., Atan, Z., Peng, P., Rong, Y., Schmitt, A., & Sinsoysal, B. (2016). OR\/MS models for supply chain disruptions: A review. IIE Transactions, 48(2), 89\u2013109.","journal-title":"IIE Transactions"},{"key":"2517_CR30","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1287\/trsc.1040.0107","volume":"39","author":"LV Snyder","year":"2005","unstructured":"Snyder, L. V., & Daskin, M. S. (2005). Reliability models for facility location: The expected failure cost case. Transportation Science, 39, 400\u2013416.","journal-title":"Transportation Science"},{"issue":"1","key":"2517_CR31","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1287\/trsc.2016.0679","volume":"51","author":"TH Tran","year":"2017","unstructured":"Tran, T. H., O\u2019Hanley, J. R., & Scaparra, M. P. (2017). Reliable hub network design: Formulation and solution techniques. Transportation Science, 51(1), 358\u2013375.","journal-title":"Transportation Science"},{"key":"2517_CR32","doi-asserted-by":"crossref","first-page":"3227","DOI":"10.1016\/j.cor.2004.05.009","volume":"32","author":"H Yaman","year":"2005","unstructured":"Yaman, H., & Carello, G. (2005). Solving the hub location problem with modular link capacities. Computers and Operations Research, 32, 3227\u20133245.","journal-title":"Computers and Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2517-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2517-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2517-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T06:57:46Z","timestamp":1546325866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2517-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,17]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["2517"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2517-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,17]]}}}