Capacitated Bounded Cardinality Hub Routing Problem: Model and Solution Algorithm

Alumur, S., Kara, B. Y., 2008. Network hub location problems: the state of the art. European Journal of Operational Research 190, 1-21. [OpenAIRE]

Alumur, S., Kara, B. Y., 2009. A hub covering network design problem for cargo applications in Turkey. Journal of the Operational Research Society 60, 1349-1359. [OpenAIRE]

Alumur, S., Kara, B. Y., Karasan, O. E., 2009. The design of single allocation incomplete hub networks. Transportation Research Part B 43, 936-951. [OpenAIRE]

Benders, J., 2005. Partitioning procedures for solving mixed-variables programming problems. Computational Management Science 2 (1), 3-19.

Benders, J. F., 1962. Partitioning procedures for solving mixed-variables programming problems. Numerische mathematik 4 (1), 238- 252. [OpenAIRE]

Boykov, Y., Kolmogorov, V., 2001. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. In: Energy minimization methods in computer vision and pattern recognition. Springer, pp. 359-374.

Campbell, J. F., Ernst, A. T., Krishnamoorthy, M., 2002. Hub location problems. In: Drezner, Z., Hamacher, H. W. (Eds.), Facility Location: Applications and Theory. Springer, pp.373-407.

Campbell, J. F., O'Kelly, M. E., 2012. Twenty-five years of hub location research. Transportation Science 46 (2), 153-169.

Cetiner, S., Sepil, C., Sural, H., 2006. Hubbing and routing in postal delivery systems. Tech. rep., Industrial Engineering Department, Middle East Technical University, 06532 Ankara, Turkey.

Çetiner, S., Sepil, C., Süral, H., 2010. Hubbing and routing in postal delivery systems. Annals of Operations Research 181 (1), 109-124. [OpenAIRE]

Codato, G., Fischetti, M., 2006. Combinatorial Benders' cuts for mixed-integer linear programming. OPERATIONS RESEARCHBALTIMORE THEN LINTHICUM- 54 (4), 756.

Contreras, I., Cordeau, J.-F., Laporte, G., 2011. Benders decomposition for large-scale uncapacitated hub location. Operations research 59 (6),1477-1490. [OpenAIRE]

Contreras, I., Fernández, E., Marín, A., 2009. Tight bounds from a path based formulation for the tree of hub location problem. Computers & Operations Research 36, 3117-3127.

Contreras, I., Fernández, E., Marín, A., 2010. The tree of hubs location problem. European Journal of Operational Research 202, 390-400.

de Camargo, R. S., de Miranda, G., Løkketangen, A., 2013. A new formulation and an exact approach for the many-to-many hub location-routing problem. Applied Mathematical Modelling 37 (12), 7465-7480.