{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:03:59Z","timestamp":1761293039942},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,6,30]],"date-time":"2013-06-30T00:00:00Z","timestamp":1372550400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Netw Spat Econ"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s11067-013-9197-3","type":"journal-article","created":{"date-parts":[[2013,6,29]],"date-time":"2013-06-29T03:52:21Z","timestamp":1372477941000},"page":"1-25","source":"Crossref","is-referenced-by-count":24,"title":["Multi-product Capacitated Single-Allocation Hub Location Problems: Formulations and Inequalities"],"prefix":"10.1007","volume":"14","author":[{"given":"Isabel","family":"Correia","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Nickel","sequence":"additional","affiliation":[]},{"given":"Francisco","family":"Saldanha-da-Gama","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,6,30]]},"reference":[{"issue":"1","key":"9197_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 BY (2008) Network hub location problems: the state of the art. Eur J Oper Res 190(1):1\u201321","journal-title":"Eur J Oper Res"},{"issue":"10","key":"9197_CR2","doi-asserted-by":"crossref","first-page":"1349","DOI":"10.1057\/jors.2008.92","volume":"60","author":"S Alumur","year":"2009","unstructured":"Alumur S, Kara BY (2009) A hub covering network design problem for cargo applications in Turkey. J Oper Res Soc 60(10):1349\u20131359","journal-title":"J Oper Res Soc"},{"issue":"10","key":"9197_CR3","doi-asserted-by":"crossref","first-page":"936","DOI":"10.1016\/j.trb.2009.04.004","volume":"43","author":"S Alumur","year":"2009","unstructured":"Alumur S, Kara BY, Karasan OE (2009) The design of single allocation incomplete hub networks. Transp Res B 43(10):936\u2013951","journal-title":"Transp Res B"},{"issue":"3","key":"9197_CR4","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/0377-2217(94)90062-0","volume":"79","author":"T Aykin","year":"1994","unstructured":"Aykin T (1994) Lagrangean relaxation based approaches to capacitated hub-and-spoke network design problem. Eur J Oper Res 79(3):501\u2013523","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9197_CR5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1287\/trsc.29.3.201","volume":"29","author":"T Aykin","year":"1995","unstructured":"Aykin T (1995) Networking policies for hub-and-spoke systems with application to the air transportation system. Transp Sci 29(3):201\u2013221","journal-title":"Transp Sci"},{"issue":"12","key":"9197_CR6","doi-asserted-by":"crossref","first-page":"3088","DOI":"10.1016\/j.cor.2008.11.023","volume":"36","author":"H Calik","year":"2009","unstructured":"Calik H, Alumur SA, Kara BY, Karasan OE (2009) A tabu-search based heuristic for the hub covering problem over incomplete hub networks. Comput Oper Res 36(12):3088\u20133096","journal-title":"Comput Oper Res"},{"issue":"2","key":"9197_CR7","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(94)90318-2","volume":"72","author":"JF Campbell","year":"1994","unstructured":"Campbell JF (1994) Integer programming formulations of discrete hub location problems. Eur J Oper Res 72(2):387\u2013405","journal-title":"Eur J Oper Res"},{"key":"9197_CR8","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/978-3-642-56082-8_12","volume-title":"Facility location: applications and theory","author":"JF Campbell","year":"2002","unstructured":"Campbell JF, Ernst AT, Krishnamoorthy M (2002) Hub location problems. In: Drezner Z, Hamacher HW (eds) Facility location: applications and theory. Springer, New York, pp 373\u2013407"},{"issue":"3","key":"9197_CR9","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s00291-008-0159-y","volume":"31","author":"I Contreras","year":"2009a","unstructured":"Contreras I, D\u00edaz J, Fern\u00e1ndez E (2009a) Lagrangean relaxation for the capacitated hub location problem with single assignment. OR Spectrum 31(3):483\u2013505","journal-title":"OR Spectrum"},{"issue":"12","key":"9197_CR10","doi-asserted-by":"crossref","first-page":"3117","DOI":"10.1016\/j.cor.2008.12.009","volume":"36","author":"I Contreras","year":"2009b","unstructured":"Contreras I, Fern\u00e1ndez E, Mar\u00edn A (2009b) Tight bounds from a path based formulation for the tree of hubs location problem. Comput Oper Res 36(12):3117\u20133127","journal-title":"Comput Oper Res"},{"issue":"2","key":"9197_CR11","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. Eur J Oper Res 202(2):390\u2013400","journal-title":"Eur J Oper Res"},{"issue":"1","key":"9197_CR12","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1287\/ijoc.1100.0391","volume":"23","author":"I Contreras","year":"2011","unstructured":"Contreras I, D\u00edas JA, Fern\u00e1ndez E (2011) Branch and price for large-scale capacitated hub location problems with single assignment. INFORMS J Comput 23(1):41\u201355","journal-title":"INFORMS J Comput"},{"issue":"8\u20139","key":"9197_CR13","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1016\/j.trb.2009.12.016","volume":"44","author":"I Correia","year":"2010a","unstructured":"Correia I, Nickel S, Saldanha-da-Gama F (2010a) Single-assignment hub location problems with multiple capacity levels. Transp Res B 44(8\u20139):1047\u20131066","journal-title":"Transp Res B"},{"issue":"1","key":"9197_CR14","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.ejor.2010.04.015","volume":"207","author":"I Correia","year":"2010b","unstructured":"Correia I, Nickel S, Saldanha-da-Gama F (2010b) The capacitated single-allocation hub location problem revisited: a note on a classical formulation. Eur J Oper Res 207(1):92\u201396","journal-title":"Eur J Oper Res"},{"issue":"11","key":"9197_CR15","doi-asserted-by":"crossref","first-page":"3671","DOI":"10.1016\/j.cor.2007.04.005","volume":"35","author":"MG Costa","year":"2008","unstructured":"Costa MG, Captivo ME, Cl\u00edmaco J (2008) Capacitated single allocation hub location problem\u2014a bi-criteria approach. Comput Oper Res 35(11):3671\u20133695","journal-title":"Comput Oper Res"},{"issue":"3","key":"9197_CR16","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0966-8349(96)00011-3","volume":"4","author":"AT Ernst","year":"1996","unstructured":"Ernst AT, Krishnamoorthy M (1996) Efficient algorithms for the uncapacitated single allocation p-hub median problem. Locat Sci 4(3):139\u2013154","journal-title":"Locat Sci"},{"key":"9197_CR17","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1018994432663","volume":"86","author":"AT Ernst","year":"1999","unstructured":"Ernst AT, Krishnamoorthy M (1999) Solution algorithms for the capacitated single allocation hub location problem. Ann Oper Res 86:141\u2013159","journal-title":"Ann Oper Res"},{"key":"9197_CR18","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/S0966-8349(98)00042-4","volume":"6","author":"JG Klincewicz","year":"1998","unstructured":"Klincewicz JG (1998) Hub location in backbone\/tributary network design: a review. Locat Sci 6:307\u2013335","journal-title":"Locat Sci"},{"issue":"2","key":"9197_CR19","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 (2005) A branch and cut algorithm for the hub location problems with single assignment. Math Program 102(2):371\u2013405","journal-title":"Math Program"},{"key":"9197_CR20","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/978-1-4757-3357-0_6","volume-title":"Mathematics methods and optimization in transportation systems","author":"S Nickel","year":"2001","unstructured":"Nickel S, Schobel A, Sonneborn T (2001) Hub location problems in urban traffic networks . In: Niittymaki J, Pursula M (eds) Mathematics methods and optimization in transportation systems. Kluwer Academic Publishers, The Netherlands, pp 95\u2013107"},{"key":"9197_CR21","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s11067-008-9061-z","volume":"10","author":"M O\u2019Kelly","year":"2010","unstructured":"O\u2019Kelly M (2010) Routing traffic at hub facilities. Netw Spat Econ 10:173\u2013191","journal-title":"Netw Spat Econ"},{"issue":"3","key":"9197_CR22","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/0377-2217(95)00100-X","volume":"94","author":"D Skorin-Kapov","year":"1996","unstructured":"Skorin-Kapov D, Skorin-Kapov J, O\u2019Kelly M (1996) Tight linear programming relaxations of uncapacitated p-hub median problems. Eur J Oper Res 94(3):582\u2013593","journal-title":"Eur J Oper Res"},{"key":"9197_CR23","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s11067-009-9126-7","volume":"11","author":"M Vidovi\u0107","year":"2011","unstructured":"Vidovi\u0107 M, Ze\u010devi\u0107 S, Kilibarda M, Vlaji\u0107 J, Bjeli\u0107 N, Tadi\u0107 S (2011) The p-hub model with hub-catchment areas, existing hubs, and simulation: a case study of serbian intermodal terminals. Netw Spat Econ 11:295\u2013314","journal-title":"Netw Spat Econ"},{"issue":"12","key":"9197_CR24","doi-asserted-by":"crossref","first-page":"3227","DOI":"10.1016\/j.cor.2004.05.009","volume":"32","author":"H Yaman","year":"2005","unstructured":"Yaman H, Carello G (2005) Solving the hub location problem with modular link capacities. Comput Oper Res 32(12):3227\u20133245","journal-title":"Comput Oper Res"}],"container-title":["Networks and Spatial Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11067-013-9197-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11067-013-9197-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11067-013-9197-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T04:40:05Z","timestamp":1559364005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11067-013-9197-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,30]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["9197"],"URL":"https:\/\/doi.org\/10.1007\/s11067-013-9197-3","relation":{},"ISSN":["1566-113X","1572-9427"],"issn-type":[{"value":"1566-113X","type":"print"},{"value":"1572-9427","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,30]]}}}