Abdinnour-Helm, S. (1998). A hybrid heuristic for the un-capacitated hub location problem. European Journal of Operational Research
Abdinnour-Helm, S., & Venkataramanan, M.A. (1998). Solution approaches to hub location problems. Annals of Operations Research
Alumur, S., & Kara, B.Y. (2008). Network hub location problems: the state of the art. European Journal of Operational Research
Bailey, A., Ornbuki-Berrnan, B., & Asobiela, S. (2013). Discrete PSO for the uncapacitated single allocation hub location problem. Proc IEEE Workshop on Computational Intelligence in Production and Logistics Systems, CIPLS, pp. 92–98, Singapore, April 16–19.
Blum, C. (2005). Ant colony optimization: introduction and recent trends. Physics of Life Reviews
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 and Operations Research
Campbell, J.F. (1992). Location and allocation for distribution systems with transshipments and transportation economies of scale. Annals of Operations Research
Campbell, J.F., Ernst, A.T., & Krishnamoorthy, M. (2002). Hub location problems. In Facility Location: Applications and Theory (Drezner, Z., & Hamacher, H.W., Eds.), pp. 373–408. New York: Springer.
Chen, J.F. (2007). A hybrid heuristic for the un-capacitated single allocation hub location problem. Omega
Chen, J.F. (2013). Heuristics for hub location problems with alternative capacity levels and allocation constraints. In Intelligent Computing Theories (Huang, D.-S., Bevilacqua, V., Figueroa, J.C., & Premaratne, P., Eds.), LNCS Vol. 7995, pp. 207–216. Berlin: Springer.
Contreras, I., Cordeau, J.-F., & Laporte, G. (2012). Exact solution of large-scale hub location problems with multiple capacity levels. Transportation Science
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
Correia, I., Nickel, S., & Saldanha-da-Gama, F. (2010). The capacitated single-allocation hub location problem revisited: a note on a classical formulation. European Journal of Operational Research
Correia, I., Nickel, S., & Saldanha-da-Gama, F. (2014). Multi-product capacitated single-allocation hub location problems: Formulations and inequalities. Networks and Spatial Economics
Cunha, C.B., & Silva, M.R. (2007). A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil. European Journal of Operational Research
Damgacioglu, H., Dinler, D., Ozdemirel, N.E., & Iyigun, C. (2015). A genetic algorithm for the uncapacitated single allocation planar hub location problem. Computers & Operations Research
Dorigo, M., Di Caro, G., & Gambardella, L.M. (1999). Ant algorithms for discrete optimization. Artificial Life
Dorigo, M., & Gambardella, L.M. (1997). Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation
Dorigo, M., & Stützle, T. (2004). Ant Colony Optimization. Cambridge, MA: MIT Press.
Ernst, A.T., & Krishnamoorthy, M. (1998). Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. European Journal of Operational Research
Ernst, A.T., & Krishnamoorthy, M. (1999). Solution algorithms for the capacitated single allocation hub location problem. Annals of Operations Research
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
Gelareh, S. (2008).
Hub location models in public transport planning
. PhD Thesis. University of Kaiserslautern.
Geramianfar, R., Pakzad, M., Golhashem, H., & Moghaddam, R. (2013). A multi-objective hub covering location problem under congestion using simulated annealing algorithm. Uncertain Supply Chain Management
Goldman, A.J. (1969). Optimal location for centers in a network. Transportation Science
Granville, V., Krivánek, M., & Rasson, J.P. (1994). Simulated annealing: a proof of convergence. IEEE Transactions on Pattern Analysis and Machine Intelligence
He, Y., Wu, T., Zhang, C., & Liang, Z. (2015). An improved MIP heuristic for the intermodal hub location problem. Omega
Henderson, D., Jacobson, S.H., & Johnson, A.W. (2003). The theory and practice of simulated annealing. In Handbook of Metaheuristics (Glover, F., & Kochenberger, G.A., Eds.), pp. 287–319. Dordrecht: Kluwer Academic.
Holland, J.H. (1992). Adaptation in Natural and Artificial Systems. Cambridge, MA: MIT Press.
Jabalameli, M.S., Barzinpour, F., Saboury, A., & Ghaffari-Nasab, N. (2012). A simulated annealing-based heuristic for the single allocation maximal covering hub location problem. International Journal of Metaheuristics
Kara, B.Y. (1999). Modeling and analysis of issues in hub location problems. PhD thesis. Bilkent University.
Kirkpatrick, S., Gelatt, C.D., & Vecchi, M.P. (1983). Optimization by simulated annealing. Science
Klincewicz, J.G. (1992). Avoiding local optima in the p-hub location problem using tabu search and grasp. Annals of Operations Research
Ma, K., & Thing, C. (2008). An ant colony optimization algorithm for solving the un-capacitated multiple allocation p-hub median. Proc. 9th Asia Pasific Industrial Engineering & Management Systems Conf., pp. 61–71, Bali, Indonesia, December 3–5.
Marić, M., Stanimirović, Z., & Stanojević, P. (2013). An efficient memetic algorithm for the uncapacitated single allocation hub location problem. Soft Computing
Marin, A. (2005). Formulating and solving splittable capacitated multiple allocation hub location problems. Computers & Operations Research
Naeem, M., & Ombuki-Berman, B. (2010). An efficient genetic algorithm for the uncapacitated single allocation hub location problem. Proc. IEEE Congr. Evolutionary Computation, CEC, pp. 1–8, Barcelona, July 18–23.
O'Kelly, M.E. (1986a). The location of interacting hub facilities. Transportation Science
O'Kelly, M.E. (1986b). Activity levels at hub facilities in interacting networks. Geographical Analysis
O'Kelly, M.E. (1987). A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research
Parvaresh, F., Hashemi Golpayegany, S.A., Moattar Husseini, S.M., & Karimi, B. (2013). Solving the p-hub median problem under intentional disruptions using simulated annealing. Networks and Spatial Economics
Puerto, J., Ramos, A.B., & Rodríguez-Chía, A.M. (2013). A specialized branch & bound & cut for single-allocation ordered median hub location problems. Discrete Applied Mathematics
Randall, M. (2008). Solution approaches for the capacitated single allocation hub location problem using ant colony optimization. Computational Optimization and Applications
Rasoulinejad, Z., Bashiri, M., & Mehrbanfar, M. (2013). A clustering based simulated annealing approach for solving an un-capacitated single allocation p-hub location problem. Proc. 5th Int. Conf. Modeling, Simulation and Applied Optimization, ICMSAO, pp. 1–6, Hammamet, Tunisia, April 28–30.
Reeves, C. (2003). Genetic algorithms. In Handbook of Metaheuristics (Glover, F., & Kochenberger, G.A., Eds.), pp. 55–82. Dordrecht: Kluwer Academic.
Saboury, A., Ghaffari-Nasab, N., Barzinpour, F., & Jabalameli, M.S. (2013). Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks. Computers & Operations Research
Sender, J., & Clausen, U. (2013). Heuristics for solving a capacitated multiple allocation hub location problem with application in German wagonload traffic. Electronic Notes in Discrete Mathematics
Skorin-Kapov, D., & Skorin-Kapov, J. (1994). On tabu search for the location of interacting hub facilities. European Journal of Operational Research
Stanimirovic, Z. (2010). A genetic algorithm approach for the capacitated single allocation p-hub median problem. Computing and Informatics
Sun, J. (2011). An ant colony optimization algorithm for the capacitated hub location problem. Proc. 2011 New Orleans Int. Academic Conf., pp. 721–732, New Orleans, March 14–16.
Sung, C.S., & Jin, H.W. (2001). Dual-based approach for a hub network design problem under non-restrictive policy. European Journal of Operational Research
Topcuoglu, H., Corut, F., Ermis, M., & Yilmaz, G. (2005). Solving the un-capacitated hub location problem using genetic algorithms. Computers & Operations Research
Wagner, B. (2007). An exact solution procedure for a cluster hub location problem. European Journal of Operational Research
Xu, L., Hu, D., Xuan, D., & Lin, H. (2009). A tabu search algorithm to logistics network design for multiple hub location routing problem. In Logistics: The Emerging Frontiers of Transportation and Development in China (Liu, R., Zhang, J., & Guan, C., Eds.), pp. 889–896. New York: American Society of Civil Engineers.
Yaman, H. (2005). Polyhedral analysis for the uncapacitated hub location problem with modular arc capacities. SIAM Journal on Discrete Mathematics