Capacity selection for hubs and hub links in hub location problems

References

• Alumur, S., & Kara, B. Y. (2008). Network hub location problems: The state of the art. European Journal of Operational Research, 190, 1–21.
   Web of Science ®Google Scholar
• Alumur, S. A., Kara, B. Y., & Karasan, O. E. (2009). The design of single allocation incomplete hub networks. Transportation Research Part B: Methodological, 43, 936–951.
   Web of Science ®Google Scholar
• Boukani, F. H., Moghaddam, B. F., & Pishvaee, M. S. (2014). Robust optimization approach to capacitated single and multiple allocation hub location problems. Computational and Applied Mathematics 76, 1091–1110.
   Google Scholar
• Calık, H., Alumur, S. A., Kara, B. Y., & Karasan, O. E. (2009). A tabu-search based heuristic for the hub covering problem over incomplete hub networks. Computers & Operations Research, 36, 3088–3096.
   Web of Science ®Google Scholar
• Campbell, J. F. (1994). Integer programming formulations of discrete hub location problems. European Journal of Operational Research, 72, 387–405.
   Web of Science ®Google Scholar
• Campbell, J. F., Ernst, A. T., & Krishnamoorthy, M. (2002). Hub location problems. In Z. Drezner & H. W. Hamacher (Eds.), Facility Location – Applications and Theory (pp. 373–407). Berlin: Springer.
   Google Scholar
• Campbell, A. M., Lowe, T. J., & Zhang, L. (2007). The p-hub center allocation problem. European Journal of Operational Research, 176, 819–835.
   Web of Science ®Google Scholar
• Campbell, J. F., & O'Kelly, M. E. (2012). Twenty-five years of hub location research. Transportation Science, 46, 153–169.
   Web of Science ®Google Scholar
• Carello, G., Della Croce, F., Ghirardi, M., & Tadei, R. (2004). Solving the hub location problem in telecommunication network design: A local search approach. Networks, 44, 94–105.
   Web of Science ®Google Scholar
• Chou, Y. H. (1990). The hierarchical-hub model for airline networks. Transportation Planning and Technology, 14, 243–258.
   Google Scholar
• Contreras, I., Díaz, J. A., & Fernández, E. (2009). Lagrangean relaxation for the capacitated hub location problem with single assignment. OR Spectrum, 31, 483–505.
   Web of Science ®Google Scholar
• Contreras, I., Díaz, J. A., & Fernández, E. (2011). Branch and price for large-scale capacitated hub location problems with single assignment. INFORMS Journal on Computing, 23, 41–55.
   Web of Science ®Google Scholar
• Correia, I., Nickel, S., & Saldanha-da-Gama, F. (2010). Single-assignment hub location problems with multiple capacity levels. Transportation Research Part B: Methodological, 44, 1047–1066.
   Web of Science ®Google Scholar
• Correia, I., Nickel, S., & Saldanha-da-Gama, F. (2011). Hub and spoke network design with single-assignment, capacity decisions and balancing requirements. Applied Mathematical Modelling, 35, 4841–4851.
   Web of Science ®Google Scholar
• da Graça Costa, M., Captivo, M. E., & Clímaco, J. (2008). Capacitated single allocation hub location problem – a bi-criteria approach. Computers & Operations Research, 35, 3671–3695.
   Web of Science ®Google Scholar
• Ernst, A. T., & Krishnamoorthy, M. (1996). Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science, 4, 139–154.
   Google Scholar
• Ernst, A. T., & Krishnamoorthy, M. (1999). Solution algorithms for the capacitated single allocation hub location problem. Annals of Operations Research, 86, 141–159.
   Web of Science ®Google Scholar
• Farahani, R. Z., Hekmatfar, M., Arabani, A. B., & Nikbakhsh, E. (2013). Hub location problems: A review of models, classification, solution techniques, and applications. Computers & Industrial Engineering, 64, 1096–1109.
   Web of Science ®Google Scholar
• Gelareh, S., & Nickel, S. (2011). Hub location problems in transportation networks. Transportation Research Part E: Logistics and Transportation Review, 47, 1092–1111.
   Web of Science ®Google Scholar
• Ghaffari-Nasab, N., Ghazanfari, M., & Teimoury, E. (in press). Hub-and-spoke logistics network design for third party logistics service providers. International Journal of Management Science and Engineering Management. Retrieved from http://dx.doi.org/10.1080/17509653.2014.992994.
   Google Scholar
• Karimi, H., & Setak, M. (2013). Proprietor and customer costs in the incomplete hub location-routing network topology. Applied Mathematical Modelling, 38, 1011–1023.
   Web of Science ®Google Scholar
• Kim, H., & O'Kelly, M. E. (2009). Reliable p-hub location problems in telecommunication networks. Geographical Analysis, 41, 283–306.
   Web of Science ®Google Scholar
• Klincewicz, J. G. (1998). Hub location in backbone/tributary network design: A review. Location Science, 6, 307–335.
   Google Scholar
• Labbé, M., Yaman, H., & Gourdin, E. (2005). A branch and cut algorithm for hub location problems with single assignment. Mathematical Programming, 102, 371–405.
   Web of Science ®Google Scholar
• O'Kelly, M. E. (1987). A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research, 32, 393–404.
   Web of Science ®Google Scholar
• Setak, M., Karimi, H., & Rastani, S. (2013). Designing incomplete hub location-routing network in urban transportation problem. International Journal of Engineering-Transactions C: Aspects, 26, 997–1006.
   Google Scholar
• Yaman, H. (2008). Star p-hub median problem with modular arc capacities. Computers & Operations Research, 35, 3009–3019.
   Web of Science ®Google Scholar
• Yaman, H., & Carello, G. (2005). Solving the hub location problem with modular link capacities. Computers & Operations Research, 32, 3227–3245.
   Web of Science ®Google Scholar