Hub Location with Protection Under Interhub Link Failures

References

• Altner DS, Ergun Ö, Uhan NA (2010) The maximum flow network interdiction problem: Valid inequalities, integrality gaps, and approximability. Oper. Res. Lett. 38(1):33–38.Crossref, Google Scholar
• Alumur S, Nickel S, da Gama FS (2012) Hub location under uncertainty. Transportation Res. Part B Methodological 46(4):529–543.Crossref, Google Scholar
• An Y, Zhang Y, Zeng B (2015) The reliable hub-and-spoke design problem: Models and algorithms. Transportation Res. Part B Methodological 77:103–122.Crossref, Google Scholar
• Andreas AK, Smith JC (2008) Mathematical programming algorithms for two-path routing problems with reliability considerations. INFORMS J. Comput. 20(4):553–564.Link, Google Scholar
• Aneja YP, Chandrasekaran R, Nair K (2001) Maximizing residual flow under an arc destruction. Networks 38(4):194–198.Crossref, Google Scholar
• Aráoz J, Fernández E, Franquesa C (2009) The clustered prize-collecting arc routing problem. Transportation Sci. 43(3):287–300.Link, Google Scholar
• Belenguer JM, Benavent E (1998) The capacitated arc routing problem: Valid inequalities and facets. Comput. Optim. Appl. 10(2):165–187.Crossref, Google Scholar
• Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1):35–53.Link, Google Scholar
• Campbell J, O’Kelly M (2012) Twenty-five years of hub location research. Transportation Sci. 46(2):153–169.Link, Google Scholar
• Campbell JF, Ernst AT, Krishnamoorthy M (2005) Hub arc location problems: Part I—Introduction and results. Management Sci. 51(10):1540–1555.Link, Google Scholar
• Cánovas L, García S, Marín A (2007) Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique. Eur. J. Oper. Res. 179(3):990–1007.Crossref, Google Scholar
• Çetiner S, Sepil C, Süral H (2010) Hubbing and routing in postal delivery systems. Ann. Oper. Res. 181(1):109–124.Crossref, Google Scholar
• Contreras I, O’Kelly M (2019) Hub location problems. Laporte G, Nickel S, Saldanha da Gama F, eds. Location Science, 2nd ed. (Springer), 177–205.Crossref, Google Scholar
• Contreras I, Cordeau JF, Laporte G (2011) Stochastic uncapacitated hub location. Eur. J. Oper. Res. 212(3):518–528.Crossref, Google Scholar
• Cormican KJ, Morton DP, Wood RK (1998) Stochastic network interdiction. Oper. Res. 46(2):184–197.Link, Google Scholar
• Cui T, Ouyang Y, Shen ZJM (2010) Reliable facility location design under the risk of disruptions. Oper. Res. 58(4):998–1011.Link, Google Scholar
• de Camargo RS, Miranda G Jr, Ferreira RPM, Luna H (2009) Multiple allocation hub-and-spoke network design under hub congestion. Comput. Oper. Res. 36(12):3097–3106.Crossref, Google Scholar
• Erdoğan G, Battarra M, Rodríguez-Chía AM (2022) The hub location and pricing problem. Eur. J. Oper. Res. 301(3):1035–1047.Crossref, Google Scholar
• Ernst AT, Krishnamoorthy M (1996) Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Sci. 4(3):139–154.Crossref, Google Scholar
• Farahani RZ, Hekmatfar M, Arabani AB, Nikbakhsh E (2013) Hub location problems: A review of models, classification, solution techniques, and applications. Comput. Indust. Engrg. 64(4):1096–1109.Crossref, Google Scholar
• Gusfield D (1993) Very simple methods for all pairs network flow analysis. SIAM J. Appl. Math. 19(1):143–155.Google Scholar
• Huang X, Tian YP (2017) Localization in sensor networks with communication delays and package losses. 2017 IEEE 56th Annual Conf. Decision Control (IEEE), 3974–3979.Google Scholar
• Kim H, O’Kelly ME (2009) Reliable p-hub location problems in telecommunication networks. Geographical Anal. 41(3):283–306.Crossref, Google Scholar
• Korani E, Eydi A (2021) Bi-level programming model and KKT penalty function solution approach for reliable hub location problem. Expert Systems Appl. 184:115505.Crossref, Google Scholar
• Li Y, Li X, Shu J, Song M, Zhang K (2022) A general model and efficient algorithms for reliable facility location problem under uncertain disruptions. INFORMS J. Comput. 34(1):407–426.Link, Google Scholar
• Ma J, Pajouh FM, Balasundaram B, Boginski V (2016) The minimum spanning k-core problem with bounded CVaR under probabilistic edge failures. INFORMS J. Comput. 28(2):295–307.Link, Google Scholar
• Marín A, Cánovas L, Landete M (2006) New formulations for the uncapacitated multiple allocation hub location problem. Eur. J. Oper. Res. 172(1):274–292.Crossref, Google Scholar
• Mohammadi M, Jula P, Tavakkoli-Moghaddam R (2019) Reliable single-allocation hub location problem with disruptions. Transportation Res. Part E Logist. Transportation Rev. 123:90–120.Crossref, Google Scholar
• O’Kelly ME (1987) A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32(3):393–404.Crossref, Google Scholar
• Oliveira FA, de Sá EM, de Souza SR (2022) Benders decomposition applied to profit maximizing hub location problem with incomplete hub network. Comput. Oper. Res. 142:105715.Crossref, Google Scholar
• Padberg M, Grötschel M (1985) Polyhedral computations. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley), 307–360.Google Scholar
• Parvaresh F, Hashemi Golpayegany SA, Moattar Husseini SM, Karimi B (2013) Solving the p-hub median problem under intentional disruptions using simulated annealing. Networks Spatial Econom.s 13(4):445–470.Crossref, Google Scholar
• Rodríguez-Pereira J, Fernández E, Laporte G, Benavent E, Martínez-Sykora A (2019) The Steiner traveling salesman problem and its extensions. Eur. J. Oper. Res. 278(2):615–628.Crossref, Google Scholar
• Rostami B, Kämmerling N, Buchheim C, Clausen U (2019) Reliable single allocation hub location problem under hub breakdowns. Comput. Oper. Res. 96:15–29.Crossref, Google Scholar
• Royset JO, Wood RK (2007) Solving the bi-objective maximum-flow network-interdiction problem. INFORMS J. Comput. 19(2):175–184.Link, Google Scholar
• Snyder LV, Daskin MS (2005) Reliability models for facility location: The expected failure cost case. Transportation Sci. 39(3):400–416.Link, Google Scholar
• Tan PZ, Kara BY (2007) A hub covering model for cargo delivery systems. Networks 49(1):28–39.Crossref, Google Scholar
• Wei N, Walteros JL, Worden MR, Ortiz-Peña HJ (2021) A resiliency analysis of information distribution policies over mobile ad hoc networks. Optim. Lett. 15(4):1081–1103.Crossref, Google Scholar
• Wood RK (1993) Deterministic network interdiction. Math. Comput. Model. 17(2):1–18.Crossref, Google Scholar
• Zeng B, An Y, Zhang Y, Kim H (2010) A reliable hub-spoke model in transportation systems. Proc. Fourth Internat. Sympos. Transportation Network Reliability, 22–23.Google Scholar
• Zetina C, Contreras I, Cordeau JF, Nikbakhsh E (2017) Robust uncapacitated hub location. Transportation Res. Part B Methodological 106:393–410.Crossref, Google Scholar
• Zheng Y, Ji Y, Shen Y, Liu B, Du Y (2022) Hub location problem considering spoke links with incentive-dependent capacities. Comput. Oper. Res. 148:105959.Crossref, Google Scholar