{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T05:05:30Z","timestamp":1767675930299,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T00:00:00Z","timestamp":1609977600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T00:00:00Z","timestamp":1609977600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s40314-020-01405-2","type":"journal-article","created":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T22:03:01Z","timestamp":1610056981000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Adjustable robust balanced hub location problem with uncertain transportation cost"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3426-1642","authenticated-orcid":false,"given":"Reza","family":"Rahmati","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0120-3358","authenticated-orcid":false,"given":"Hossein","family":"Neghabi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,7]]},"reference":[{"issue":"4","key":"1405_CR1","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.trb.2011.11.006","volume":"46","author":"SA Alumur","year":"2012","unstructured":"Alumur SA, Nickel S, da Gama FS (2012) Hub location under uncertainty. Transport Res Part B Methodol 46(4):529\u2013543. https:\/\/doi.org\/10.1016\/j.trb.2011.11.006","journal-title":"Transport Res Part B Methodol"},{"issue":"1","key":"1405_CR2","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4(1):238\u2013252. https:\/\/doi.org\/10.1007\/BF01386316","journal-title":"Numerische Mathematik"},{"issue":"2","key":"1405_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","volume":"99","author":"A Ben-Tal","year":"2004","unstructured":"Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math Program 99(2):351\u2013376. https:\/\/doi.org\/10.1007\/s10107-003-0454-y","journal-title":"Math Program"},{"key":"1405_CR4","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal A, El Ghaoui L, Nemirovski L (2009) Robust optimization. Princeton University Press, Princeton"},{"issue":"1","key":"1405_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D Bertsimas","year":"2003","unstructured":"Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math Program 98(1):49\u201371. https:\/\/doi.org\/10.1007\/s10107-003-0396-4","journal-title":"Math Program"},{"issue":"3","key":"1405_CR6","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev 53(3):464\u2013501. https:\/\/doi.org\/10.1137\/080734510","journal-title":"SIAM Rev"},{"issue":"1","key":"1405_CR7","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/TPWRS.2012.2205021","volume":"28","author":"D Bertsimas","year":"2013","unstructured":"Bertsimas D, Litvinov E, Sun XA, Zhao J, Zheng T (2013) Adaptive robust optimization for the security constrained unit commitment problem. IEEE Trans Power Syst 28(1):52\u201363. https:\/\/doi.org\/10.1109\/TPWRS.2012.2205021","journal-title":"IEEE Trans Power Syst"},{"issue":"2","key":"1405_CR8","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1016\/0377-2217(94)90318-2","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1405_CR9","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1016\/j.ejor.2011.02.018","volume":"212","author":"I Contreras","year":"2011","unstructured":"Contreras I, Cordeau JF, Laporte G (2011) Stochastic uncapacitated hub location. Eur J Oper Res 212(3):518\u2013528. https:\/\/doi.org\/10.1016\/j.ejor.2011.02.018","journal-title":"Eur J Oper Res"},{"key":"1405_CR10","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.omega.2017.01.011","volume":"74","author":"I Correia","year":"2018","unstructured":"Correia I, Nickel S, da Gama FS (2018) A stochastic multi-period capacitated multiple allocation hub location problem: formulation and inequalities. Omega 74:122\u2013134. https:\/\/doi.org\/10.1016\/j.omega.2017.01.011","journal-title":"Omega"},{"key":"1405_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s40314-019-1025-z","author":"D \u010cvoki\u0107","year":"2019","unstructured":"\u010cvoki\u0107 D, Stanimirovi\u0107 Z (2019) A single allocation hub location and pricing problem. Comput Appl Math. https:\/\/doi.org\/10.1007\/s40314-019-1025-z","journal-title":"Comput Appl Math"},{"key":"1405_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.cor.2017.08.001","volume":"89","author":"EM de S\u00e1","year":"2018","unstructured":"de S\u00e1 EM, Morabito R, de Camargo RS (2018a) Benders decomposition applied to a robust multiple allocation incomplete hub location problem. Comput Oper Res 89:31\u201350. https:\/\/doi.org\/10.1016\/j.cor.2017.08.001","journal-title":"Comput Oper Res"},{"key":"1405_CR13","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.eswa.2017.10.005","volume":"93","author":"EM de S\u00e1","year":"2018","unstructured":"de S\u00e1 EM, Morabito R, de Camargo RS (2018b) Efficient benders decomposition algorithms for the robust multiple allocation incomplete hub location problem with service time requirements. Expert Syst Appl 93:50\u201361. https:\/\/doi.org\/10.1016\/j.eswa.2017.10.005","journal-title":"Expert Syst Appl"},{"issue":"4","key":"1405_CR14","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1016\/j.cie.2013.01.012","volume":"64","author":"RZ Farahani","year":"2013","unstructured":"Farahani RZ, Hekmatfar M, Arabani AB, Nikbakhsh E (2013) Hub location problems: a review of models, classification, solution techniques, and applications. Comput Ind Eng 64(4):1096\u20131109. https:\/\/doi.org\/10.1016\/j.cie.2013.01.012","journal-title":"Comput Ind Eng"},{"key":"1405_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.cor.2018.04.021","volume":"97","author":"N Ghaffarinasab","year":"2018","unstructured":"Ghaffarinasab N (2018) An efficient matheuristic for the robust multiple allocation p-hub median problem under polyhedral demand uncertainty. Comput Oper Res 97:31\u201347. https:\/\/doi.org\/10.1016\/j.cor.2018.04.021","journal-title":"Comput Oper Res"},{"issue":"5","key":"1405_CR16","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1007\/s00170-014-6330-5","volume":"76","author":"N Ghaffari-Nasab","year":"2015","unstructured":"Ghaffari-Nasab N, Ghazanfari M, Teimoury E (2015) Robust optimization approach to the design of hub-and-spoke networks. Int J Adv Manuf Technol 76(5):1091\u20131110. https:\/\/doi.org\/10.1007\/s00170-014-6330-5","journal-title":"Int J Adv Manuf Technol"},{"issue":"4","key":"1405_CR17","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1287\/trsc.3.4.352","volume":"3","author":"AJ Goldman","year":"1969","unstructured":"Goldman AJ (1969) Optimal locations for centers in a network. Transport Sci 3(4):352\u2013360. https:\/\/doi.org\/10.1287\/trsc.3.4.352","journal-title":"Transport Sci"},{"issue":"1","key":"1405_CR18","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s40314-014-0179-y","volume":"35","author":"F Habibzadeh Boukani","year":"2016","unstructured":"Habibzadeh Boukani F, Farhang Moghaddam B, Pishvaee MS (2016) Robust optimization approach to capacitated single and multiple allocation hub location problems. Comput Appl Math 35(1):45\u201360. https:\/\/doi.org\/10.1007\/s40314-014-0179-y","journal-title":"Comput Appl Math"},{"issue":"6","key":"1405_CR19","doi-asserted-by":"publisher","first-page":"3384","DOI":"10.1137\/100791841","volume":"20","author":"V Jeyakumar","year":"2010","unstructured":"Jeyakumar V, Li GY (2010) Strong duality in robust convex programming: complete characterizations. SIAM J Optim 20(6):3384\u20133407. https:\/\/doi.org\/10.1137\/100791841","journal-title":"SIAM J Optim"},{"key":"1405_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s40314-016-0368-y","author":"H Karimi","year":"2018","unstructured":"Karimi H, Setak M (2018) Flow shipment scheduling in an incomplete hub location-routing network design problem. Comput Appl Math. https:\/\/doi.org\/10.1007\/s40314-016-0368-y","journal-title":"Comput Appl Math"},{"key":"1405_CR21","doi-asserted-by":"publisher","first-page":"66178","DOI":"10.1109\/ACCESS.2020.2985377","volume":"8","author":"S Li","year":"2020","unstructured":"Li S, Fang C, Wu Y (2020) Robust hub location problem with flow-based set-up cost. IEEE Access 8:66178\u201366188","journal-title":"IEEE Access"},{"issue":"1","key":"1405_CR22","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1287\/opre.2015.1456","volume":"64","author":"Sun XA Lorca","year":"2016","unstructured":"Lorca Sun XA, Litvinov E, Zheng T (2016) Multistage adaptive robust optimization for the unit commitment problem. Oper Res 64(1):32\u201351. https:\/\/doi.org\/10.1287\/opre.2015.1456","journal-title":"Oper Res"},{"key":"1405_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/s40092-019-00329-9","author":"A Lozkins","year":"2019","unstructured":"Lozkins A, Krasilnikov M, Bure V (2019) Robust uncapacitated multiple allocation hub location problem under demand uncertainty: minimization of cost deviations. J Ind Eng Int. https:\/\/doi.org\/10.1007\/s40092-019-00329-9","journal-title":"J Ind Eng Int"},{"key":"1405_CR24","doi-asserted-by":"publisher","DOI":"10.1287\/opre.29.3.464","author":"T Magnanti","year":"1981","unstructured":"Magnanti T, Wong R (1981) Accelerating benders decomposition: algorithmic enhancement and model selection criteria. Oper Res. https:\/\/doi.org\/10.1287\/opre.29.3.464","journal-title":"Oper Res"},{"key":"1405_CR25","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.trb.2016.01.010","volume":"86","author":"M Merakli","year":"2016","unstructured":"Merakli M, Yaman H (2016) Robust intermodal hub location under polyhedral demand uncertainty. Transport Res Part B Methodol 86:66\u201385. https:\/\/doi.org\/10.1016\/j.trb.2016.01.010","journal-title":"Transport Res Part B Methodol"},{"key":"1405_CR26","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.cor.2017.06.011","volume":"88","author":"M Merakli","year":"2017","unstructured":"Merakli M, Yaman H (2017) A capacitated hub location problem under hose demand uncertainty. Comput Oper Res 88:58\u201370. https:\/\/doi.org\/10.1016\/j.cor.2017.06.011","journal-title":"Comput Oper Res"},{"issue":"2","key":"1405_CR27","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1287\/trsc.20.2.92","volume":"20","author":"ME O\u2019Kelly","year":"1986","unstructured":"O\u2019Kelly ME (1986) The location of interacting hub facilities. Transport Sci 20(2):92\u2013106. https:\/\/doi.org\/10.1287\/trsc.20.2.92","journal-title":"Transport Sci"},{"issue":"3","key":"1405_CR28","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0377-2217(87)80007-3","volume":"32","author":"ME O\u2019Kelly","year":"1987","unstructured":"O\u2019Kelly ME (1987) A quadratic integer program for the location of interacting hub facilities. Eur J Oper Res 32(3):393\u2013404. https:\/\/doi.org\/10.1016\/S0377-2217(87)80007-3","journal-title":"Eur J Oper Res"},{"key":"1405_CR29","unstructured":"Rahmati R, Bashiri M (2018) Robust hub location problem with uncertain inter hub flow discount factor. In: Proceedings of the international conference on industrial engineering and operations management 2018, Paris, France, 26\u201327 July, 2018"},{"key":"1405_CR30","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.tre.2014.08.003","volume":"70","author":"M Shahabi","year":"2014","unstructured":"Shahabi M, Unnikrishnan A (2014) Robust hub network design problem. Transport Res Part E Logist Transport Rev 70:356\u2013373. https:\/\/doi.org\/10.1016\/j.tre.2014.08.003","journal-title":"Transport Res Part E Logist Transport Rev"},{"issue":"5","key":"1405_CR31","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"AL Soyster","year":"1973","unstructured":"Soyster AL (1973) Technical note\u2013convex programming with set-inclusive constraints and applications to inexact linear programming. Oper Res 21(5):1154\u20131157. https:\/\/doi.org\/10.1287\/opre.21.5.1154","journal-title":"Oper Res"},{"key":"1405_CR32","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/j.cie.2017.06.017","volume":"110","author":"EG Talbi","year":"2017","unstructured":"Talbi EG, Todosijevi\u0107 R (2017) The robust uncapacitated multiple allocation p-hub median problem. Comput Ind Eng 110:322\u2013332. https:\/\/doi.org\/10.1016\/j.cie.2017.06.017","journal-title":"Comput Ind Eng"},{"key":"1405_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/s40314-017-0512-3","author":"H Tikani","year":"2018","unstructured":"Tikani H, Honarvar M, Mehrjerdi Y (2018) Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry. Comput Appl Math. https:\/\/doi.org\/10.1007\/s40314-017-0512-3","journal-title":"Comput Appl Math"},{"issue":"5","key":"1405_CR34","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.orl.2013.05.003","volume":"41","author":"B Zeng","year":"2013","unstructured":"Zeng B, Zhao L (2013) Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper Res Lett 41(5):457\u2013461. https:\/\/doi.org\/10.1016\/j.orl.2013.05.003","journal-title":"Oper Res Lett"},{"key":"1405_CR35","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.trb.2017.06.008","volume":"106","author":"CA Zetina","year":"2017","unstructured":"Zetina CA, Contreras I, Cordeau JF, Nikbakhsh E (2017) Robust uncapacitated hub location. Transport Res Part B Methodol 106:393\u2013410. https:\/\/doi.org\/10.1016\/j.trb.2017.06.008","journal-title":"Transport Res Part B Methodol"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01405-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s40314-020-01405-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01405-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T20:21:06Z","timestamp":1613074866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s40314-020-01405-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,7]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["1405"],"URL":"https:\/\/doi.org\/10.1007\/s40314-020-01405-2","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2021,1,7]]},"assertion":[{"value":"27 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"14"}}