{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:28Z","timestamp":1740145168660,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T00:00:00Z","timestamp":1528675200000},"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":["Optim Lett"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s11590-018-1282-6","type":"journal-article","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T10:14:28Z","timestamp":1528712068000},"page":"825-836","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A branch and cut algorithm for the capacitated star\u2013star telecommunication network problem"],"prefix":"10.1007","volume":"13","author":[{"given":"H\u00fcseyin","family":"G\u00fcden","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8148-1031","authenticated-orcid":false,"given":"Ertan","family":"Yak\u0131c\u0131","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,11]]},"reference":[{"issue":"10","key":"1282_CR1","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1016\/j.trb.2009.04.004","volume":"43","author":"S Alumur","year":"2009","unstructured":"Alumur, S., Kara, B.Y., Karasan, O.E.: The design of single allocation incomplete hub networks. Transp. Res. Part B 43(10), 936\u2013951 (2009)","journal-title":"Transp. Res. Part B"},{"issue":"6","key":"1282_CR2","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1016\/j.tre.2012.04.001","volume":"48","author":"SA Alumur","year":"2012","unstructured":"Alumur, S.A., Yaman, H., Kara, B.Y.: Hierarchical multimodal hub location problem with time-definite deliveries. Transp. Res. Part E 48(6), 1107\u20131120 (2012)","journal-title":"Transp. Res. Part E"},{"issue":"5","key":"1282_CR3","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1007\/s11590-016-1022-8","volume":"10","author":"D Ambrosino","year":"2016","unstructured":"Ambrosino, D., Sciomachen, A.: A capacitated hub location problem in freight logistics multimodal networks. Optim. Lett. 10(5), 875\u2013901 (2016)","journal-title":"Optim. Lett."},{"issue":"12","key":"1282_CR4","doi-asserted-by":"publisher","first-page":"3088","DOI":"10.1016\/j.cor.2008.11.023","volume":"36","author":"H Calik","year":"2009","unstructured":"Calik, H., Alumur, S., Kara, B.Y., Karasan, O.E.: A tabu-search based heuristic for the hub covering problem over incomplete hub networks. Comput. Oper. Res. 36(12), 3088\u20133096 (2009)","journal-title":"Comput. Oper. Res."},{"key":"1282_CR5","first-page":"1","volume-title":"Mathematics Methods and Optimization in Transportation Systems","author":"S Nickel","year":"2001","unstructured":"Nickel, S., Schobel, A., Sonneborn, T.: Hub location problems in urban traffic networks. In: Niittymaki, J., Pursula, M. (eds.) Mathematics Methods and Optimization in Transportation Systems, pp. 1\u201312. Kluwer, Dordrecht (2001)"},{"issue":"1","key":"1282_CR6","doi-asserted-by":"publisher","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.: The hub network design problem: a review and synthesis. J. Transp. Geogr. 2(1), 31\u201340 (1994)","journal-title":"J. Transp. Geogr."},{"issue":"6","key":"1282_CR7","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/j.trb.2009.01.005","volume":"43","author":"H Yaman","year":"2009","unstructured":"Yaman, H.: The hierarchical hub median problem with single assignment. Transp. Res. Part B 43(6), 643\u2013658 (2009)","journal-title":"Transp. Res. Part B"},{"issue":"1","key":"1282_CR8","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1057\/palgrave.jors.2602307","volume":"59","author":"MG Yoon","year":"2008","unstructured":"Yoon, M.G., Current, J.: The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic. J. Oper. Res. Soc. 59(1), 80\u201389 (2008)","journal-title":"J. Oper. Res. Soc."},{"key":"1282_CR9","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1002\/net.3230190404","volume":"19","author":"MP Helme","year":"1989","unstructured":"Helme, M.P., Magnanti, T.L.: Designing satellite communication networks by zero-one quadratic programming. Networks 19, 427\u2013450 (1989)","journal-title":"Networks"},{"key":"1282_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/A:1018942415824","volume":"86","author":"P Chardaire","year":"1999","unstructured":"Chardaire, P., Lutton, J.L., Sutter, A.: Upper and lower bounds for the two-level simple plant location problem. Ann. Oper. Res. 86, 117\u2013140 (1999)","journal-title":"Ann. Oper. Res."},{"key":"1282_CR11","unstructured":"Labb\u00e9, M., Yaman, H.: Solving the hub location problem in a star\u2013star network. Technical report, revised version of ISRO\/OR Preprint 2003\/15, Universite Libre de Bruxelles, Brussels (2004)"},{"issue":"9","key":"1282_CR12","doi-asserted-by":"publisher","first-page":"3009","DOI":"10.1016\/j.cor.2007.01.014","volume":"35","author":"H Yaman","year":"2008","unstructured":"Yaman, H.: Star p-hub median problem with modular arc capacities. Comput. Oper. Res. 35(9), 3009\u20133019 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"11","key":"1282_CR13","doi-asserted-by":"publisher","first-page":"2725","DOI":"10.1016\/j.cor.2012.02.005","volume":"39","author":"H Yaman","year":"2012","unstructured":"Yaman, H., Elloumi, S.: Star p-hub center problem and star p-hub median problem with bounded path lengths. Comput. Oper. Res. 39(11), 2725\u20132732 (2012)","journal-title":"Comput. Oper. Res."},{"key":"1282_CR14","volume-title":"Concentrator Location in Telecommunications Networks","author":"H Yaman","year":"2006","unstructured":"Yaman, H.: Concentrator Location in Telecommunications Networks. Springer, Berlin (2006)"},{"issue":"7","key":"1282_CR15","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1007\/s11590-012-0552-y","volume":"7","author":"A Bosco","year":"2013","unstructured":"Bosco, A., Lagan\u00e0, D., Musmanno, R., Vocaturo, F.: Modeling and solving the mixed capacitated general routing problem. Optim. Lett. 7(7), 1451\u20131469 (2013)","journal-title":"Optim. Lett."},{"issue":"3","key":"1282_CR16","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1287\/opre.1060.0283","volume":"54","author":"JF Cordeau","year":"2006","unstructured":"Cordeau, J.F.: A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54(3), 573\u2013586 (2006)","journal-title":"Oper. Res."},{"issue":"2","key":"1282_CR17","doi-asserted-by":"publisher","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.: A branch and cut algorithm for hub location problems with single assignment. Math. Program. 102(2), 371\u2013405 (2005)","journal-title":"Math. Program."},{"issue":"2","key":"1282_CR18","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"J Lysgaard","year":"2004","unstructured":"Lysgaard, J., Letchford, A.N., Eglese, R.W.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 100(2), 423\u2013445 (2004)","journal-title":"Math. Program."},{"key":"1282_CR19","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.cor.2014.04.014","volume":"50","author":"I Rodr\u00edguez-Mart\u00edn","year":"2014","unstructured":"Rodr\u00edguez-Mart\u00edn, I., Salazar-Gonz\u00e1lez, J.J., Yaman, H.: A branch-and-cut algorithm for the hub location and routing problem. Comput. Oper. Res. 50, 161\u2013174 (2014)","journal-title":"Comput. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1282-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-018-1282-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1282-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T19:15:00Z","timestamp":1560194100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-018-1282-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,11]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["1282"],"URL":"https:\/\/doi.org\/10.1007\/s11590-018-1282-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2018,6,11]]},"assertion":[{"value":"9 February 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}