Abdinnour-Helm, S. (2001). Using simulated annealing to solve the p-hub median problem. International Journal of Physical Distribution & Logistics Management, 31(3), 203-220.
An, Y., Zhang, Y., & Zeng, B. (2015). The reliable hub-and-spoke design problem: Models and algorithms. Transportation Research Part B: Methodological, 77, 103-122.
An, Y., Zeng, B., Zhang, Y., Zhao, L. (2014). Reliable p-median facility location problem: the two-stage robust models and algorithms. Transportation Research Part B, 64, 54-72.
Azizi, N., Chauhan, S., Salhi, S., & Vidyarthi, N. (2016). The impact of hub failure in hub-and-spoke networks: Mathematical formulations and solution techniques. Computers & Operations Research, 65, 174-188.
Berman, O., Krass, D., & Menezes, M. B. (2009). Locating facilities in the presence of disruptions and incomplete information. Decision Sciences, 40(4), 845-868.
Campbell, J. F. (1994). Integer programming formulations of discrete hub location problems. European Journal of Operational Research, 72(2), 387-405.
Demir, E., Bektaş, T., & Laporte, G. (2012). An adaptive large neighborhood search heuristic for the pollution-routing problem. European Journal of Operational Research, 223(2), 346-359.
Ebery, J. (2001). Solving large single allocation p-hub problems with two or three hubs. European Journal of Operational Research, 128(2), 447-458.
Ernst, A. T., & Krishnamoorthy, M. (1996). Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science, 4(3), 139-154.
Grangier, P., Gendreau, M., Lehuédé, F., & Rousseau, L. M. (2016). An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. European Journal of Operational Research, 254(1), 80-91.
Hemmelmayr, V. C., Cordeau, J. F., & Crainic, T. G. (2012). An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Computers & Operations Research, 39(12), 3215-3228.
Kim, H. (2008). Reliable p-hub location problems and protection models for hub network design (Doctoral dissertation, The Ohio State University).
Kim, H., & O'Kelly, M. E. (2009). Reliable p‐hub location problems in telecommunication networks. Geographical Analysis, 41(3), 283-306.
Lin, C. C., Lin, J. Y., & Chen, Y. C. (2012). The capacitated p-hub median problem with integral constraints: An application to a Chinese air cargo network. Applied Mathematical Modelling, 36(6), 2777-2787.
Lutz, R. (2015). Adaptive Large Neighborhood Search. Bachelor thesis at Ulm University.
Martí, R., Corberán, Á., & Peiró, J. (2015). Scatter search for an uncapacitated p-hub median problem. Computers & Operations Research, 58, 53-66.
Matisziw, T. C., Murray, A. T., & Grubesic, T. H. (2010). Strategic network restoration. Networks and Spatial Economics, 10(3), 345-361.
Mauri, G. R., Ribeiro, G. M., Lorena, L. A. N., & Laporte, G. (2016). An adaptive large neighborhood search for the discrete and continuous Berth allocation problem. Computers & Operations Research, 70, 140-154.
Medal, H. R., Pohl, E. A., & Rossetti, M. D. (2014). A multi-objective integrated facility location-hardening model: Analyzing the pre-and post-disruption tradeoff. European Journal of Operational Research, 237(1), 257-270.
Mohammadi, M., Tavakkoli-Moghaddam, R., Siadat, A., & Dantan, J. Y. (2016). Design of a reliable logistics network with hub disruption under uncertainty. Applied Mathematical Modelling, 40(9), 5621-5642.
O'kelly, M. E. (1987). A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research, 32(3), 393-404.
Parvaresh, F., Golpayegany, S. H., Husseini, S. M., & Karimi, B. (2013). Solving the p-hub median problem under intentional disruptions using simulated annealing. Networks and Spatial Economics, 13(4), 445-470.
Parvaresh, F., Husseini, S. M., Golpayegany, S. H., & Karimi, B. (2014). Hub network design problem in the presence of disruptions. Journal of Intelligent Manufacturing, 25(4), 755-774.
Pérez, M. P., Rodríguez, F. A., & Moreno-Vega, J. M. (2007). A hybrid VNS–path relinking for the p-hub median problem. IMA Journal of Management Mathematics, 18(2), 157-171.
Ropke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40(4), 455-472.
Shaw, P. (1998, October). Using constraint programming and local search methods to solve vehicle routing problems. In International Conference on Principles and Practice of Constraint Programming (pp. 417-431). Springer Berlin Heidelberg.
Shen, Z. J. M., Zhan, R. L., & Zhang, J. (2011). The reliable facility location problem: Formulations, heuristics, and approximation algorithms. INFORMS Journal on Computing, 23(3), 470-482.
Skorin-Kapov, D., & Skorin-Kapov, J. (1994). On tabu search for the location of interacting hub facilities. European Journal of Operational Research, 73(3), 502-509.
Skorin-Kapov, D., Skorin-Kapov, J., & O'Kelly, M. (1997). Tight linear programming relaxation of uncapacitated p-hub median problems. Location Science, 5(1), 68-69.
Snyder, L. V., & Daskin, M. S. (2005). Reliability models for facility location: the expected failure cost case. Transportation Science, 39(3), 400-416.
Taghipourian, F., Mahdavi, I., Mahdavi-Amiri, N., & Makui, A. (2012). A fuzzy programming approach for dynamic virtual hub location problem. Applied Mathematical Modelling, 36(7), 3257-3270.
Wang, X., & Ouyang, Y. (2013). A continuum approximation approach to competitive facility location design under facility disruption risks. Transportation Research Part B: Methodological, 50, 90-103.
Wilson, M. C. (2007). The impact of transportation disruptions on supply chain performance. Transportation Research Part E: Logistics and Transportation Review, 43(4), 295-320.
Zeng, B., An, Y., Zhang, Y., & Kim, H. (2010, July). A reliable hub-spoke model in transportation systems. In Proceedings of the 4th international symposium on transportation network reliability, Minneapolis, Minnesota, USA (pp. 22-23).