{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T21:03:27Z","timestamp":1781298207078,"version":"3.54.1"},"reference-count":45,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.cor.2026.107532","type":"journal-article","created":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T15:26:57Z","timestamp":1778945217000},"page":"107532","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Double-layer Benders decomposition for large-scale robust uncapacitated hub location"],"prefix":"10.1016","volume":"194","author":[{"given":"Haifeng","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2281-7217","authenticated-orcid":false,"given":"Jian-Cai","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5629-6574","authenticated-orcid":false,"given":"Yuan","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2026.107532_b1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2020.09.039","article-title":"Perspectives on modeling hub location problems","volume":"291","author":"Alumur","year":"2021","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107532_b2","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/j.trb.2011.11.006","article-title":"Hub location under uncertainty","volume":"46","author":"Alumur","year":"2012","journal-title":"Transp. Res. B"},{"key":"10.1016\/j.cor.2026.107532_b3","doi-asserted-by":"crossref","first-page":"954","DOI":"10.1016\/j.ejor.2023.07.015","article-title":"A heuristic approach to the stochastic capacitated single allocation hub location problem with bernoulli demands","volume":"312","author":"Andaryan","year":"2024","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107532_b4","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/trsc.2022.0112","article-title":"Hub network design problem with capacity, congestion, and stochastic demand considerations","volume":"57","author":"Bayram","year":"2023","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2026.107532_b5","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","article-title":"Partitioning procedures for solving mixed-variables programming problems","volume":"4","author":"Benders","year":"1962","journal-title":"Numer. Math."},{"key":"10.1016\/j.cor.2026.107532_b6","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","article-title":"Robust discrete optimization and network flows","volume":"98","author":"Bertsimas","year":"2003","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2026.107532_b7","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1016\/S0377-2217(03)00072-9","article-title":"Preprocessing and cutting for multiple allocation hub location problems","volume":"155","author":"Boland","year":"2004","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107532_b8","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1016\/j.cor.2006.07.002","article-title":"Benders decomposition for the uncapacitated multiple allocation hub location problem","volume":"35","author":"de Camargo","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107532_b9","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(94)90318-2","article-title":"Integer programming formulations of discrete hub location problems","volume":"72","author":"Campbell","year":"1994","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107532_b10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/trsc.1120.0410","article-title":"Twenty-five years of hub location research","volume":"46","author":"Campbell","year":"2012","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2026.107532_b11","doi-asserted-by":"crossref","first-page":"1477","DOI":"10.1287\/opre.1110.0965","article-title":"Benders decomposition for large-scale uncapacitated hub location","volume":"59","author":"Contreras","year":"2011","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2026.107532_b12","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1016\/j.ejor.2011.02.018","article-title":"Stochastic uncapacitated hub location","volume":"212","author":"Contreras","year":"2011","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107532_b13","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1287\/trsc.1110.0398","article-title":"Exact solution of large-scale hub location problems with multiple capacity levels","volume":"46","author":"Contreras","year":"2012","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2026.107532_b14","series-title":"Hub Location Problems","first-page":"327","author":"Contreras","year":"2019"},{"key":"10.1016\/j.cor.2026.107532_b15","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/j.apm.2017.06.035","article-title":"Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints","volume":"51","author":"De Camargo","year":"2017","journal-title":"Appl. Math. Model."},{"key":"10.1016\/j.cor.2026.107532_b16","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0966-8349(96)00011-3","article-title":"Efficient algorithms for the uncapacitated single allocation p-hub median problem","volume":"4","author":"Ernst","year":"1996","journal-title":"Locat. Sci."},{"key":"10.1016\/j.cor.2026.107532_b17","series-title":"Facility Location under Uncertainty: Models, Algorithms and Applications","first-page":"293","article-title":"Hub location","author":"Saldanha-da Gama","year":"2024"},{"key":"10.1016\/j.cor.2026.107532_b18","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.cor.2018.04.021","article-title":"An efficient matheuristic for the robust multiple allocation p-hub median problem under polyhedral demand uncertainty","volume":"97","author":"Ghaffarinasab","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107532_b19","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.trb.2022.11.008","article-title":"A mean-CVaR approach to the risk-averse single allocation hub location problem with flow-dependent economies of scale","volume":"167","author":"Ghaffarinasab","year":"2023","journal-title":"Transp. Res. B"},{"key":"10.1016\/j.cor.2026.107532_b20","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1007\/s00170-014-6330-5","article-title":"Robust optimization approach to the design of hub-and-spoke networks","volume":"76","author":"Ghaffarinasab","year":"2015","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.cor.2026.107532_b21","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2021.102602","article-title":"A conditional \u03b2-mean approach to risk-averse stochastic multiple allocation hub location problems","volume":"158","author":"Ghaffarinasab","year":"2022","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"10.1016\/j.cor.2026.107532_b22","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.trb.2022.01.002","article-title":"The stratified p-hub center and p-hub maximal covering problems","volume":"157","author":"Ghaffarinasab","year":"2022","journal-title":"Transp. Res. B"},{"key":"10.1016\/j.cor.2026.107532_b23","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.dam.2003.09.011","article-title":"Adapting polyhedral properties from facility to hub location problems","volume":"145","author":"Hamacher","year":"2004","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.cor.2026.107532_b24","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1287\/opre.2022.0319","article-title":"Budget-driven multiperiod hub location: A robust time-series approach","volume":"73","author":"Hu","year":"2025","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2026.107532_b25","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105760","article-title":"Risk-averse hub location: Formulation and solution approach","volume":"143","author":"Kargar","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107532_b26","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.trb.2016.01.010","article-title":"Robust intermodal hub location under polyhedral demand uncertainty","volume":"86","author":"Merakl\u0131","year":"2016","journal-title":"Transp. Res. B"},{"key":"10.1016\/j.cor.2026.107532_b27","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.trb.2019.12.003","article-title":"Benders decomposition for multiple-allocation hub-and-spoke network design with economies of scale and node congestion","volume":"133","author":"Najy","year":"2020","journal-title":"Transp. Res. B"},{"key":"10.1016\/j.cor.2026.107532_b28","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0966-6923(98)00010-6","article-title":"A geographer\u2019s analysis of hub-and-spoke networks","volume":"6","author":"O\u2019Kelly","year":"1998","journal-title":"J. Transp. Geogr."},{"key":"10.1016\/j.cor.2026.107532_b29","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105715","article-title":"Benders decomposition applied to profit maximizing hub location problem with incomplete hub network","volume":"142","author":"Oliveira","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107532_b30","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/j.ejor.2016.12.005","article-title":"The Benders decomposition algorithm: A literature review","volume":"259","author":"Rahmaniani","year":"2017","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107532_b31","doi-asserted-by":"crossref","first-page":"5235","DOI":"10.1080\/00207543.2021.1953179","article-title":"A two-stage robust hub location problem with accelerated benders decomposition algorithm","volume":"60","author":"Rahmati","year":"2022","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107532_b32","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2023.102921","article-title":"Stochastic regional-based profit-maximizing hub location problem: A sustainable overview","volume":"121","author":"Rahmati","year":"2023","journal-title":"Omega"},{"key":"10.1016\/j.cor.2026.107532_b33","article-title":"Data-driven wasserstein distributionally robust profit-maximising hub location problem","author":"Rahmati","year":"2025","journal-title":"Transp. A: Transp. Sci."},{"key":"10.1016\/j.cor.2026.107532_b34","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.cor.2017.08.001","article-title":"Benders decomposition applied to a robust multiple allocation incomplete hub location problem","volume":"89","author":"de S\u00e1","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107532_b35","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2024.103220","article-title":"The role of hubs and economies of scale in network expansion","volume":"131","author":"Setiawan","year":"2025","journal-title":"Omega"},{"key":"10.1016\/j.cor.2026.107532_b36","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/mnsc.1050.0451","article-title":"The optimizer\u2019s curse: Skepticism and postdecision surprise in decision analysis","volume":"52","author":"Smith","year":"2006","journal-title":"Manage. Sci."},{"key":"10.1016\/j.cor.2026.107532_b37","doi-asserted-by":"crossref","first-page":"1446","DOI":"10.1287\/trsc.2020.1003","article-title":"Benders decomposition for the profit maximizing capacitated hub location problem with multiple demand classes","volume":"54","author":"Taherkhani","year":"2020","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2026.107532_b38","doi-asserted-by":"crossref","first-page":"1322","DOI":"10.1287\/trsc.2021.1064","article-title":"Robust stochastic models for profit-maximizing hub location problems","volume":"55","author":"Taherkhani","year":"2021","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2026.107532_b39","doi-asserted-by":"crossref","DOI":"10.1016\/j.trb.2024.103040","article-title":"Sustainable hub location under uncertainty","volume":"187","author":"Taherkhani","year":"2024","journal-title":"Transp. Res. B"},{"key":"10.1016\/j.cor.2026.107532_b40","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1287\/trsc.2019.0948","article-title":"Distributionally robust hub location","volume":"54","author":"Wang","year":"2020","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2026.107532_b41","article-title":"Machine learning-empowered benders decomposition for flow hub location in e-commerce","author":"Wu","year":"2025","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2026.107532_b42","doi-asserted-by":"crossref","first-page":"4424","DOI":"10.1016\/j.apm.2009.03.018","article-title":"Stochastic air freight hub location and flight routes planning","volume":"33","author":"Yang","year":"2009","journal-title":"Appl. Math. Model."},{"key":"10.1016\/j.cor.2026.107532_b43","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/j.trb.2017.06.008","article-title":"Robust uncapacitated hub location","volume":"106","author":"Zetina","year":"2017","journal-title":"Transp. Res. B"},{"key":"10.1016\/j.cor.2026.107532_b44","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106882","article-title":"Two-stage robust multimodal hub network design under budgeted demand uncertainty: A Benders decomposition approach and a case study","volume":"174","author":"Zhang","year":"2025","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107532_b45","doi-asserted-by":"crossref","first-page":"1361","DOI":"10.1287\/ijoc.2022.0113","article-title":"Distributionally robust chance-constrained p-hub center problem","volume":"35","author":"Zhao","year":"2023","journal-title":"INFORMS J. Comput."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001504?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001504?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T20:42:27Z","timestamp":1781296947000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826001504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":45,"alternative-id":["S0305054826001504"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107532","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Double-layer Benders decomposition for large-scale robust uncapacitated hub location","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107532","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107532"}}