[1]    Drezner, Z., (2013). “Facility location. A survey of applications and methods”, Springer, New York.

[2]    O’Kelly, M.E., (1986). “The location of interacting hub facilities”, Transportation Science, (20): 92–105.

[3]    O’Kelly, M.E., (1987). “A quadratic integer program for the location of interacting hub facilities”, European Journal of Operational Research, (32): 393–404.

[4]    O’Kelly, M.E., Lao, Y., (1991). Mode choice in a hub-and-spoke network: a zero-one linear programming approach. Geographical Analysis (23): 283–397.

[5]    Campbell, J.F., (1994). “Integer programming formulations of discrete hub location problems”, European Journal of Operational Research, (72): 387–405.

[6]    Limbourg, S., Jourquin, B., (2009). “Optimal rail-road container terminal locations on the European network”, Transportation Research Part E, (45): 551–563.

[7]    Ishfaq, R., Sox, C.R., (2011). “Hub location-allocation in intermodal logistic networks”, European Journal of Operational Research (210): 213–230.

[8]    Meng, Q., Wang, X., (2011). “Intermodal hub-and-spoke network design: incorporating multiple stakeholders and multi-type containers”, Transportation Research, Part (45): 724–74.

[9]    Kara, B.Y., Tansel, B.C., (2001). “The latest arrival hub location problem”, Management Science, (47): 1408–1420.

[10] Yaman, H., Kara, B.Y., Tansel, B.C., (2007). “The latest arrival hub location problem for cargo delivery systems with stopovers”, Transportation Research Part B, (41): 906-919.

[11] Lin, C.C., Chen, S.H., (2004). “The hierarchical network design problem for time-definite express common carrier”, Transportation Research B, (38): 271–283.

[12] Lin, C.C. (2010). “The integrated secondary route network design model in the hierarchical hub-and-spoke network for dual express services”, International Journal of Production Economics (123): 20–30.

[13] Smilowitz, K.R., Daganzo, C.F. (2007). “Continuum approximation techniques for the design of integrated package distribution systems”, Networks, (50): 183–196.

[14] Chen, H., Campbell, A.M., Thomas, B.W. (2008). “Network design for time-constrained delivery”, Naval Research Logistics, (55): 493–515.

[15] Campbell, J.F. (2009). “Hub location for time definite transportation”, Computers and Operations Research, (36): 3107–3116.

[16] Sim, T., Lowe, T.J., Thomas, B.W., (2009). “The stochastic p-hub center problem with service-level constraints”, Computers & Operations Research, (36): 3166–3177.

[17]  غفاری نسب نادر، غضنفری مهدی، تیموری ابراهیم، (1392). طراحی شبکه لجستیک هاب استوار با درنظر گرفتن تقاضاهای تصادفی برای شرکت‌های ارائه دهنده خدمات لجستیکی. نشریه پژوهش‌های مهندسی صنایع در سیستم‌های تولید، 1(2): 107-97.

[18]  عیدی علیرضا، برزگر خالد، (1394). ارائه یک الگوریتم حل دقیق برای مسئله جایابی P هاب میانه با تخصیص r تایی. نشریه پژوهش‌های مهندسی صنایع در سیستم‌های تولید، 3(5): 71-61.

[19] Yaman, H., (2011). “Allocation strategies in hub networks”, European Journal of Operational Research, (211): 442–451.

[20] Alumur, S., Yaman, H., Kara, B.Y., (2012). “Hierarchical multimodal hub location problem with time-drfinite deliveries. Transportation deliveries”, Transportation Research Part E: Logistics and Transportation Review, 48(6): 1107-1120.

[21] Glareh, Sh., Neamatian monemi, N. Nickel, S., (2015). “Multi-period hub location problems in transportation. Transportation deliveries”, Transportation Research Part E: Logistics and Transportation Review, (75): 67-94.

[22] Puerto, J., Ramos, A.B., Rodríguez-Chía, A.M., Sánchez-Gil, M.C., (2016). “Ordered median hub location problems with capacity constraints”, Transportation Research Part C: Emerging Technologies, (70): 142-156.

[23] Mahmutogullari, A.I., Kara, B.K., (2016). “Hub location under competition”, European Journal of Operational Research, (250): 214-225.

[24] O'Connell, J.F., Bueno, O.E., (2016). “A study into the hub performance Emirates, Etihad Airways and Qatar Airways and their competitive position against the major European hubbing airlines”, Journal of Air Transport Management, In Press, Corrected Proof, Available online 27.