{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T18:45:18Z","timestamp":1776105918410,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,1,6]],"date-time":"2016-01-06T00:00:00Z","timestamp":1452038400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s10479-015-2091-2","type":"journal-article","created":{"date-parts":[[2016,1,6]],"date-time":"2016-01-06T07:21:34Z","timestamp":1452064894000},"page":"655-677","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Exact and heuristic approaches for the cycle hub location problem"],"prefix":"10.1007","volume":"258","author":[{"given":"Ivan","family":"Contreras","sequence":"first","affiliation":[]},{"given":"Moayad","family":"Tanash","sequence":"additional","affiliation":[]},{"given":"Navneet","family":"Vidyarthi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,6]]},"reference":[{"issue":"1","key":"2091_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","volume":"190","author":"S Alumur","year":"2008","unstructured":"Alumur, S., & Kara, B. Y. (2008). Network hub location problems: The state of the art. European Journal of Operational Research, 190(1), 1\u201321.","journal-title":"European Journal of Operational Research"},{"key":"2091_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-015-1805-9","author":"S Alumur","year":"2015","unstructured":"Alumur, S., Nickel, S., Saldana da Gama, F., & Secerdin, Y. (2015). Multi-period hub network design problems with modular capacities. Annals of Operations Research,. doi: 10.1007\/s10479-015-1805-9 .","journal-title":"Annals of Operations Research"},{"issue":"10","key":"2091_CR3","doi-asserted-by":"crossref","first-page":"936","DOI":"10.1016\/j.trb.2009.04.004","volume":"43","author":"SA Alumur","year":"2009","unstructured":"Alumur, S. A., Kara, B. Y., & Karasan, O. E. (2009). The design of single allocation incomplete hub networks. Transportation Research Part B: Methodological, 43(10), 936\u2013951.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"6","key":"2091_CR4","doi-asserted-by":"crossref","first-page":"1147","DOI":"10.1287\/opre.1070.0432","volume":"55","author":"R Baldacci","year":"2007","unstructured":"Baldacci, R., Dell\u2019Amico, M., & Gonz\u00e1lez, J. S. (2007). The capacitated m-ring-star problem. Operations Research, 55(6), 1147\u20131162.","journal-title":"Operations Research"},{"key":"2091_CR5","first-page":"1","volume":"10","author":"J Brimberg","year":"1996","unstructured":"Brimberg, J., & Mladenovic, N. (1996). A variable neighbourhood algorithm for solving the continuous location-allocation problem. Studies in Locational Analysis, 10, 1\u201312.","journal-title":"Studies in Locational Analysis"},{"issue":"12","key":"2091_CR6","doi-asserted-by":"crossref","first-page":"3088","DOI":"10.1016\/j.cor.2008.11.023","volume":"36","author":"H Cal\u0131k","year":"2009","unstructured":"Cal\u0131k, 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(12), 3088\u20133096.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"2091_CR7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/trsc.1120.0410","volume":"46","author":"JF Campbell","year":"2012","unstructured":"Campbell, J. F., & O\u2019Kelly, M. E. (2012). 25 years of hub location research. Transportation Science, 46(2), 153\u2013169.","journal-title":"Transportation Science"},{"issue":"10","key":"2091_CR8","doi-asserted-by":"crossref","first-page":"1540","DOI":"10.1287\/mnsc.1050.0406","volume":"51","author":"JF Campbell","year":"2005","unstructured":"Campbell, J. F., Ernst, A., & Krishnamoorthy, M. (2005a). Hub arc location problems: Part I: Introduction and results. Management Science, 51(10), 1540\u20131555.","journal-title":"Management Science"},{"issue":"10","key":"2091_CR9","doi-asserted-by":"crossref","first-page":"1556","DOI":"10.1287\/mnsc.1050.0407","volume":"51","author":"JF Campbell","year":"2005","unstructured":"Campbell, J. F., Ernst, A., & Krishnamoorthy, M. (2005b). Hub arc location problems: Part II: Formulations and optimal algorithms. Management Science, 51(10), 1556\u20131571.","journal-title":"Management Science"},{"key":"2091_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10479-010-0705-2","volume":"181","author":"S Cetiner","year":"2010","unstructured":"Cetiner, S., Sepil, C., & Sural, H. (2010). Hubbing and routing in postal delivery systems. Annals of Operations Research, 181, 109\u2013124.","journal-title":"Annals of Operations Research"},{"key":"2091_CR11","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/978-3-319-13111-5_12","volume-title":"Location science","author":"I Contreras","year":"2015","unstructured":"Contreras, I. (2015). Hub location problems. In G. Laporte, F. Saldanha da Gama, & S. Nickel (Eds.), Location science (pp. 311\u2013344). New York: Springer."},{"issue":"3","key":"2091_CR12","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1016\/j.ejor.2011.11.009","volume":"219","author":"I Contreras","year":"2012","unstructured":"Contreras, I., & Fern\u00e1ndez, E. (2012). General network design: A unified view of combined location and network design problems. European Journal of Operational Research, 219(3), 680\u2013697.","journal-title":"European Journal of Operational Research"},{"key":"2091_CR13","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1287\/opre.2014.1263","volume":"62","author":"I Contreras","year":"2014","unstructured":"Contreras, I., & Fern\u00e1ndez, E. (2014). Hub location as the minimization of a supermodular set function. Operations Research, 62, 557\u2013570.","journal-title":"Operations Research"},{"issue":"12","key":"2091_CR14","doi-asserted-by":"crossref","first-page":"3117","DOI":"10.1016\/j.cor.2008.12.009","volume":"36","author":"I Contreras","year":"2009","unstructured":"Contreras, I., Fern\u00e1ndez, E., & Mar\u00edn, A. (2009). Tight bounds from a path based formulation for the tree of hub location problem. Computers & Operations Research, 36(12), 3117\u20133127.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"2091_CR15","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.ejor.2009.05.044","volume":"202","author":"I Contreras","year":"2010","unstructured":"Contreras, I., Fern\u00e1ndez, E., & Mar\u00edn, A. (2010). The tree of hubs location problem. European Journal of Operational Research, 202(2), 390\u2013400.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"2091_CR16","doi-asserted-by":"crossref","first-page":"1477","DOI":"10.1287\/opre.1110.0965","volume":"59","author":"I Contreras","year":"2011","unstructured":"Contreras, I., Cordeau, J. F., & Laporte, G. (2011). Benders decomposition for large-scale uncapacitated hub location. Operations Research, 59(6), 1477\u20131490.","journal-title":"Operations Research"},{"key":"2091_CR17","volume-title":"Combinatorial Optimization","author":"W Cook","year":"1998","unstructured":"Cook, W., Cunningham, W., Pulleybank, W., & Schrijver, A. (1998). Combinatorial Optimization. Hoboken: Wiley."},{"issue":"1","key":"2091_CR18","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0377-2217(94)90149-X","volume":"73","author":"JR Current","year":"1994","unstructured":"Current, J. R., & Schilling, D. A. (1994). The median tour and maximal covering tour problems: Formulations and heuristics. European Journal of Operational Research, 73(1), 114\u2013126.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2091_CR19","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0377-2217(96)00340-2","volume":"104","author":"AT Ernst","year":"1998","unstructured":"Ernst, A. T., & Krishnamoorthy, M. (1998a). Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. European Journal of Operational Research, 104(1), 100\u2013112.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2091_CR20","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.10.2.149","volume":"10","author":"AT Ernst","year":"1998","unstructured":"Ernst, A. T., & Krishnamoorthy, M. (1998b). An exact solution approach based on shortest-paths for p-hub median problems. INFORMS Journal on Computing, 10(2), 149\u2013162.","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"2091_CR21","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s11235-010-9289-z","volume":"46","author":"P Festa","year":"2011","unstructured":"Festa, P., & Resende, M. (2011). GRASP: Basic components and enhancements. Telecommunication Systems, 46(3), 253\u2013271.","journal-title":"Telecommunication Systems"},{"issue":"4","key":"2091_CR22","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.45.4.568","volume":"45","author":"M Gendreau","year":"1997","unstructured":"Gendreau, M., Laporte, G., & Semet, F. (1997). The covering tour problem. Operations Research, 45(4), 568\u2013576.","journal-title":"Operations Research"},{"issue":"1","key":"2091_CR23","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.dam.2003.09.011","volume":"145","author":"HW Hamacher","year":"2004","unstructured":"Hamacher, H. W., Labb\u00e9, M., Nickel, S., & Sonneborn, T. (2004). Adapting polyhedral properties from facility to hub location problems. Discrete Applied Mathematics, 145(1), 104\u2013116.","journal-title":"Discrete Applied Mathematics"},{"key":"2091_CR24","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s10479-013-1394-4","volume":"211","author":"C Iyigun","year":"2013","unstructured":"Iyigun, C. (2013). The planar hub location problem: A probabilistic clustering approach. Annals of Operations Research, 211, 193\u2013207.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"2091_CR25","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0360-8352(92)90005-5","volume":"22","author":"JG Kim","year":"1992","unstructured":"Kim, J. G., & Tcha, D. W. (1992). Optimal design of a two-level hierarchical network with tree-star configuration. Computers & Industrial Engineering, 22(3), 273\u2013281.","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"2091_CR26","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/S0966-8349(98)00042-4","volume":"6","author":"J Klincewicz","year":"1998","unstructured":"Klincewicz, J. (1998). Hub location in backbone\/tributary network design: A review. Location Science, 6(1), 307\u2013335.","journal-title":"Location Science"},{"issue":"2","key":"2091_CR27","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1002\/net.20019","volume":"44","author":"M Labb\u00e9","year":"2004","unstructured":"Labb\u00e9, M., & Yaman, H. (2004). Projecting the flow variables for hub location problems. Networks, 44(2), 84\u201393.","journal-title":"Networks"},{"issue":"1","key":"2091_CR28","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.20193","volume":"51","author":"M Labb\u00e9","year":"2008","unstructured":"Labb\u00e9, M., & Yaman, H. (2008). Solving the hub location problem in a star-star network. Networks, 51(1), 19\u201333.","journal-title":"Networks"},{"issue":"3","key":"2091_CR29","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/net.10114","volume":"43","author":"M Labb\u00e9","year":"2004","unstructured":"Labb\u00e9, M., Laporte, G., Rodr\u00edguez Mart\u00edn, I., & Salazar-Gonz\u00e1lez, J. J. (2004). The ring star problem: Polyhedral analysis and exact algorithm. Networks, 43(3), 177\u2013189.","journal-title":"Networks"},{"issue":"2","key":"2091_CR30","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.ejor.2003.07.010","volume":"160","author":"M Labb\u00e9","year":"2005","unstructured":"Labb\u00e9, M., Laporte, G., Rodr\u00edguez Mart\u00edn, I., & Salazar-Gonz\u00e1lez, J. J. (2005a). Locating median cycles in networks. European Journal of Operational Research, 160(2), 457\u2013470.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2091_CR31","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10107-004-0531-x","volume":"102","author":"M Labb\u00e9","year":"2005","unstructured":"Labb\u00e9, M., Yaman, H., & Gourdin, E. (2005b). A branch and cut algorithm for hub location problems with single assignment. Mathematical programming, 102(2), 371\u2013405.","journal-title":"Mathematical programming"},{"issue":"1","key":"2091_CR32","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02109861","volume":"2","author":"Y Lee","year":"1993","unstructured":"Lee, Y., Lu, L., Qiu, Y., & Glover, F. (1993). Strong formulations and cutting planes for designing digital data service networks. Telecommunication Systems, 2(1), 261\u2013274.","journal-title":"Telecommunication Systems"},{"issue":"3","key":"2091_CR33","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0966-8349(96)00009-5","volume":"4","author":"Y Lee","year":"1996","unstructured":"Lee, Y., Lim, B. H., & Park, J. S. (1996). A hub location problem in designing digital data service networks: Lagrangian relaxation approach. Location Science, 4(3), 185\u2013194.","journal-title":"Location Science"},{"issue":"1","key":"2091_CR34","first-page":"21","volume":"4","author":"Y Lee","year":"1998","unstructured":"Lee, Y., Chiu, S., & Sanchez, J. (1998). A branch and cut algorithm for the steiner ring star problem. International Journal of Management Science, 4(1), 21\u201334.","journal-title":"International Journal of Management Science"},{"issue":"6","key":"2091_CR35","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1016\/j.cor.2009.09.004","volume":"37","author":"A Liefooghe","year":"2010","unstructured":"Liefooghe, A., Jourdan, L., & Talbi, E. G. (2010). Metaheuristics and cooperative approaches for the bi-objective ring star problem. Computers & Operations Research, 37(6), 1033\u20131044.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"2091_CR36","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1287\/trsc.20.2.92","volume":"20","author":"ME O\u2019Kelly","year":"1986","unstructured":"O\u2019Kelly, M. E. (1986). The location of interacting hub facilities. Transportation Science, 20(2), 92\u2013106.","journal-title":"Transportation Science"},{"issue":"1","key":"2091_CR37","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0966-6923(94)90032-9","volume":"2","author":"ME O\u2019Kelly","year":"1994","unstructured":"O\u2019Kelly, M. E., & Miller, H. J. (1994). The hub network design problem: A review and synthesis. Journal of Transport Geography, 2(1), 31\u201340.","journal-title":"Journal of Transport Geography"},{"issue":"3","key":"2091_CR38","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/net.10068","volume":"41","author":"F Ortega","year":"2003","unstructured":"Ortega, F., & Wolsey, L. A. (2003). A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks, 41(3), 143\u2013158.","journal-title":"Networks"},{"key":"2091_CR39","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.dam.2015.01.035","volume":"187","author":"C Ortiz-Astorquiza","year":"2015","unstructured":"Ortiz-Astorquiza, C., Contreras, I., & Laporte, G. (2015). The minimum flow cost Hamiltonian cycle problem: A comparison of formulations. Discrete Applied Mathematics, 187, 140\u2013154.","journal-title":"Discrete Applied Mathematics"},{"key":"2091_CR40","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.ejor.2012.10.051","volume":"226","author":"E Martins de S\u00e1","year":"2013","unstructured":"Martins de S\u00e1, E., de Camargo, R., & de Miranda, G. (2013). An improved Benders decomposition algorithm for the tree of hubs location problem. European Journal of Operational Research, 226, 185\u2013202.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2091_CR41","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.ejor.2015.04.017","volume":"246","author":"E Martins de S\u00e1","year":"2015","unstructured":"Martins de S\u00e1, E., Contreras, I., & Cordeau, J. F. (2015a). Exact and heuristic algorithms for the design of hub networks with multiple lines. European Journal of Operational Research, 246(1), 186\u2013198.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2091_CR42","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1287\/trsc.2014.0576","volume":"49","author":"E Martins de S\u00e1","year":"2015","unstructured":"Martins de S\u00e1, E., Contreras, I., Cordeau, J. F., de Camargo, R. S., & de Miranda, G. (2015b). The hub line location problem. Transportation Science, 49(3), 500\u2013518.","journal-title":"Transportation Science"},{"issue":"3","key":"2091_CR43","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/mnsc.45.3.330","volume":"45","author":"J Xu","year":"1999","unstructured":"Xu, J., Chiu, S. Y., & Glover, F. (1999). Optimizing a ring-based private line telecommunication network using tabu search. Management Science, 45(3), 330\u2013345.","journal-title":"Management Science"},{"issue":"9","key":"2091_CR44","doi-asserted-by":"crossref","first-page":"3009","DOI":"10.1016\/j.cor.2007.01.014","volume":"35","author":"H Yaman","year":"2008","unstructured":"Yaman, H. (2008). Star p-hub median problem with modular arc capacities. Computers & Operations Research, 35(9), 3009\u20133019.","journal-title":"Computers & Operations Research"},{"issue":"6","key":"2091_CR45","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/j.trb.2009.01.005","volume":"43","author":"H Yaman","year":"2009","unstructured":"Yaman, H. (2009). The hierarchical hub median problem with single assignment. Transportation Research Part B: Methodological, 43(6), 643\u2013658.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"11","key":"2091_CR46","doi-asserted-by":"crossref","first-page":"2725","DOI":"10.1016\/j.cor.2012.02.005","volume":"39","author":"H Yaman","year":"2012","unstructured":"Yaman, H., & Elloumi, S. (2012). Star p-hub center problem and star p-hub median problem with bounded path lengths. Computers & Operations Research, 39(11), 2725\u20132732.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"2091_CR47","doi-asserted-by":"crossref","first-page":"1096","DOI":"10.1016\/j.cie.2013.01.012","volume":"64","author":"R Zanjirani Farahani","year":"2013","unstructured":"Zanjirani Farahani, R., Hekmatfar, M., Arabani, A. B., & Nikbakhsh, E. (2013). Hub location problems: A review of models, classification, solution techniques, and applications. Computers & Industrial Engineering, 64(4), 1096\u20131109.","journal-title":"Computers & Industrial Engineering"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-2091-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2091-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2091-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2091-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T11:28:14Z","timestamp":1692185294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-2091-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,6]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["2091"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-2091-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,6]]}}}