{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T04:04:50Z","timestamp":1743393890291,"version":"3.40.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T00:00:00Z","timestamp":1741046400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T00:00:00Z","timestamp":1741046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"crossref","award":["455963"],"award-info":[{"award-number":["455963"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s10898-025-01472-x","type":"journal-article","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T11:54:36Z","timestamp":1741089276000},"page":"923-951","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Stochastic red-blue set covering: a decomposition approach"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-6857-097X","authenticated-orcid":false,"given":"David","family":"Islip","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0502-1607","authenticated-orcid":false,"given":"Roy H.","family":"Kwon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,4]]},"reference":[{"key":"1472_CR1","unstructured":"Carr, R.D., Doddi, S., Konjevod, G., Marathe, M.: On the red-blue set cover problem. Technical report, Sandia National Labs., Albuquerque, NM (US); Sandia National Labs (1999)"},{"key":"1472_CR2","unstructured":"CMHC: Housing at the Heart of Our Accomplishments: CMHC Annual Report 2022. Copyright - Copyright CNW Group 2023; Last updated - 2023-05-04 (2023)"},{"key":"1472_CR3","unstructured":"Younglai, R.: CMHC reports growing share of mortgage insurance clients close to underwater on loans: the disclosure provides a glimpse into how borrowers have fared after the Bank of Canada hiked interest rates. Copyright - Copyright The Globe and Mail May 5, 2023; Last updated - 2023-05-05 (2023)"},{"issue":"3\u20134","key":"1472_CR4","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1287\/mnsc.1.3-4.197","volume":"1","author":"GB Dantzig","year":"1955","unstructured":"Dantzig, G.B.: Linear programming under uncertainty. Manag. Sci. 1(3\u20134), 197\u2013206 (1955)","journal-title":"Manag. Sci."},{"key":"1472_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to Stochastic Programming","author":"JR Birge","year":"2011","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, New York (2011)"},{"issue":"1","key":"1472_CR6","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J Benders","year":"1962","unstructured":"Benders, J.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4(1), 238\u2013252 (1962)","journal-title":"Numer. Math."},{"issue":"3","key":"1472_CR7","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1287\/opre.2019.1892","volume":"68","author":"R Rahmaniani","year":"2020","unstructured":"Rahmaniani, R., Ahmed, S., Crainic, T.G., Gendreau, M., Rei, W.: The benders dual decomposition method. Oper. Res. 68(3), 878\u2013895 (2020)","journal-title":"Oper. Res."},{"key":"1472_CR8","unstructured":"Gurobi: Gurobi Webinar - solving simple stochastic optimization problems with Gurobi (2021). https:\/\/www.gurobi.com\/resource\/solving-simple-stochastic-optimization-problems-with-gurobi\/"},{"issue":"2","key":"1472_CR9","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"AJ Kleywegt","year":"2002","unstructured":"Kleywegt, A.J., Shapiro, A., Homem-de-Mello, T.: The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2), 479\u2013502 (2002)","journal-title":"SIAM J. Optim."},{"key":"1472_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF01580883","volume":"35","author":"A Ruszczy\u0144ski","year":"1986","unstructured":"Ruszczy\u0144ski, A.: A regularized decomposition method for minimizing a sum of polyhedral functions. Math. Program. 35, 309\u2013333 (1986)","journal-title":"Math. Program."},{"key":"1472_CR11","first-page":"141","volume":"10","author":"A Ruszczy\u0144ski","year":"2003","unstructured":"Ruszczy\u0144ski, A.: Decomposition methods. Handb. Oper. Res. Manag. Sci. 10, 141\u2013211 (2003)","journal-title":"Handb. Oper. Res. Manag. Sci."},{"key":"1472_CR12","unstructured":"Linderoth, J., Wright, S.: Decomposition algorithms for stochastic programming on a computational grid. arXiv:math\/0106151 (2001)"},{"issue":"3","key":"1472_CR13","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/j.ejor.2016.12.005","volume":"259","author":"R Rahmaniani","year":"2017","unstructured":"Rahmaniani, R., Crainic, T.G., Gendreau, M., Rei, W.: The benders decomposition algorithm: a literature review. Eur. J. Oper. Res. 259(3), 801\u2013817 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"1472_CR14","doi-asserted-by":"crossref","unstructured":"K\u00fc\u00e7\u00fckyavuz, S., Sen, S.: An introduction to two-stage stochastic mixed-integer programming. In: Leading Developments from INFORMS Communities, pp. 1\u201327. INFORMS, Catonsville, MD, USA (2017)","DOI":"10.1287\/educ.2017.0171"},{"issue":"1","key":"1472_CR15","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10107-012-0615-y","volume":"144","author":"D Gade","year":"2014","unstructured":"Gade, D., K\u00fc\u00e7\u00fckyavuz, S., Sen, S.: Decomposition algorithms with parametric gomory cuts for two-stage stochastic integer programs. Math. Program. 144(1), 39\u201364 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"1472_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10107-005-0592-5","volume":"106","author":"S Sen","year":"2006","unstructured":"Sen, S., Sherali, H.D.: Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming. Math. Program. 106(2), 203\u2013223 (2006)","journal-title":"Math. Program."},{"issue":"3","key":"1472_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0167-6377(93)90002-X","volume":"13","author":"G Laporte","year":"1993","unstructured":"Laporte, G., Louveaux, F.V.: The integer l-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13(3), 133\u2013142 (1993)","journal-title":"Oper. Res. Lett."},{"key":"1472_CR18","doi-asserted-by":"crossref","unstructured":"Sen, S.: Stochastic mixed-integer programming algorithms: beyond benders\u2019 decomposition. In: Wiley Encyclopedia of Operations Research and Management Science. Wiley, Hoboken (2010)","DOI":"10.1002\/9780470400531.eorms0232"},{"key":"1472_CR19","first-page":"515","volume":"12","author":"S Sen","year":"2005","unstructured":"Sen, S.: Algorithms for stochastic mixed-integer programming models. Handb. Oper. Res. Manag. Sci. 12, 515\u2013558 (2005)","journal-title":"Handb. Oper. Res. Manag. Sci."},{"key":"1472_CR20","first-page":"213","volume":"10","author":"FV Louveaux","year":"2003","unstructured":"Louveaux, F.V., Schultz, R.: Stochastic integer programming. Handb. Oper. Res. Manag. Sci. 10, 213\u2013266 (2003)","journal-title":"Handb. Oper. Res. Manag. Sci."},{"key":"1472_CR21","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/A:1018930113099","volume":"85","author":"WKK Haneveld","year":"1999","unstructured":"Haneveld, W.K.K., Vlerk, M.H.: Stochastic integer programming: general models and algorithms. Ann. Oper. Res. 85, 39 (1999)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"1472_CR22","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1111\/j.1467-9574.1996.tb01506.x","volume":"50","author":"R Schultz","year":"1996","unstructured":"Schultz, R., Stougie, L., Van Der Vlerk, M.H.: Two-stage stochastic integer programming: a survey. Stat. Neerl. 50(3), 404\u2013416 (1996)","journal-title":"Stat. Neerl."},{"key":"1472_CR23","doi-asserted-by":"crossref","unstructured":"Bomze, I., Chimani, M., J\u00fcnger, M., Ljubi\u0107, I., Mutzel, P., Zey, B.: Solving two-stage stochastic Steiner tree problems by two-stage branch-and-cut. In: International Symposium on Algorithms and Computation. Springer, pp. 427\u2013439 (2010)","DOI":"10.1007\/978-3-642-17517-6_38"},{"issue":"3","key":"1472_CR24","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s10589-017-9966-x","volume":"69","author":"M Leitner","year":"2018","unstructured":"Leitner, M., Ljubi\u0107, I., Luipersbeck, M., Sinnl, M.: Decomposition methods for the two-stage stochastic Steiner tree problem. Comput. Optim. Appl. 69(3), 713\u2013752 (2018)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1472_CR25","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ejor.2004.01.046","volume":"167","author":"T Santoso","year":"2005","unstructured":"Santoso, T., Ahmed, S., Goetschalckx, M., Shapiro, A.: A stochastic programming approach for supply chain network design under uncertainty. Eur. J. Oper. Res. 167(1), 96\u2013115 (2005)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1472_CR26","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10589-017-9958-x","volume":"69","author":"H-H Wu","year":"2018","unstructured":"Wu, H.-H., K\u00fc\u00e7\u00fckyavuz, S.: A two-stage stochastic programming approach for influence maximization in social networks. Comput. Optim. Appl. 69(3), 563\u2013595 (2018)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"1472_CR27","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1016\/j.ejor.2018.12.021","volume":"275","author":"J-F Cordeau","year":"2019","unstructured":"Cordeau, J.-F., Furini, F., Ljubi\u0107, I.: Benders decomposition for very large scale partial set covering and maximal covering location problems. Eur. J. Oper. Res. 275(3), 882\u2013896 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"1472_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-11008-0_1","volume-title":"Integer Programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming, pp. 1\u201344. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11008-0_1"},{"issue":"2","key":"1472_CR29","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10994-019-05855-6","volume":"109","author":"JE Van Engelen","year":"2020","unstructured":"Van Engelen, J.E., Hoos, H.H.: A survey on semi-supervised learning. Mach. Learn. 109(2), 373\u2013440 (2020)","journal-title":"Mach. Learn."},{"issue":"3","key":"1472_CR30","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1111\/1540-6229.12310","volume":"49","author":"K Basiri","year":"2021","unstructured":"Basiri, K., Mahmoudi, B.: Possible income misstatement on mortgage loan applications: evidence from the Canadian housing market. Real Estate Econ. 49(3), 917\u2013935 (2021). https:\/\/doi.org\/10.1111\/1540-6229.12310","journal-title":"Real Estate Econ."},{"key":"1472_CR31","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"AM Geoffrion","year":"1972","unstructured":"Geoffrion, A.M.: Generalized benders decomposition. J. Optim. Theory Appl. 10, 237\u2013260 (1972)","journal-title":"J. Optim. Theory Appl."},{"key":"1472_CR32","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10107-018-1249-5","volume":"175","author":"J Zou","year":"2019","unstructured":"Zou, J., Ahmed, S., Sun, X.A.: Stochastic dual dynamic integer programming. Math. Program. 175, 461\u2013502 (2019)","journal-title":"Math. Program."},{"key":"1472_CR33","unstructured":"Van\u00a0Gestel, B.: Mortgage fraud and facilitating circumstances. In: Bullock, K., Clarke, R.V.G., Tilley, N. (eds.) Situational Prevention of Organised Crimes, pp. 111\u2013129. Willan Publishing, Uffculme, Cullompton, UK (2013)"},{"issue":"5","key":"1472_CR34","doi-asserted-by":"publisher","first-page":"1292","DOI":"10.1111\/joes.12294","volume":"32","author":"A Reurink","year":"2018","unstructured":"Reurink, A.: Financial Fraud: A literature review. J. Econ. Sur. 32(5), 1292\u20131325 (2018). https:\/\/doi.org\/10.1111\/joes.12294","journal-title":"J. Econ. Sur."},{"key":"1472_CR35","doi-asserted-by":"crossref","unstructured":"Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring network structure, dynamics, and function using networkx. In: Varoquaux, G., Vaught, T., Millman, J. (eds.) Proceedings of the 7th Python in Science Conference, Pasadena, CA USA, pp. 11\u201315 (2008)","DOI":"10.25080\/TCWV9851"},{"key":"1472_CR36","doi-asserted-by":"crossref","unstructured":"Giatsoglou, M., Chatzakou, D., Shah, N., Faloutsos, C., Vakali, A.: Retweeting activity on twitter: signs of deception. In: Advances in Knowledge Discovery and Data Mining: 19th Pacific-Asia Conference, PAKDD 2015, Ho Chi Minh City, Vietnam, May 19\u201322, 2015, Proceedings, Part I 19, pp. 122\u2013134 (2015). Springer","DOI":"10.1007\/978-3-319-18038-0_10"},{"issue":"6","key":"1472_CR37","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevApplied.19.064001","volume":"19","author":"J Tangpanitanon","year":"2023","unstructured":"Tangpanitanon, J., Saiphet, J., Palittapongarnpim, P., Chaiwongkhot, P., Prugsanapan, P., Raksasri, N., Wannasiwaporn, W., Raksri, Y., Thajchayapong, P., Chotibut, T.: Hybrid quantum-classical algorithms for loan-collection optimization with loan-loss provisions. Phys. Rev. Appl. 19(6), 064001 (2023)","journal-title":"Phys. Rev. Appl."},{"issue":"1","key":"1472_CR38","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/evco_a_00242","volume":"27","author":"P Kerschke","year":"2019","unstructured":"Kerschke, P., Hoos, H.H., Neumann, F., Trautmann, H.: Automated algorithm selection: survey and perspectives. Evol. Comput. 27(1), 3\u201345 (2019)","journal-title":"Evol. Comput."},{"key":"1472_CR39","doi-asserted-by":"crossref","unstructured":"Deza, A., Khalil, E.B.: Machine learning for cutting planes in integer programming: a survey. arXiv preprint arXiv:2302.09166 (2023)","DOI":"10.24963\/ijcai.2023\/739"},{"key":"1472_CR40","unstructured":"Vandenbussche, B., Delikaraoglou, S., Blanco, I., Hug, G.: Data-driven adaptive benders decomposition for the stochastic unit commitment problem. arXiv preprint arXiv:1912.01039 (2019)"},{"issue":"5","key":"1472_CR41","doi-asserted-by":"publisher","first-page":"2804","DOI":"10.1287\/ijoc.2022.1207","volume":"34","author":"K Seo","year":"2022","unstructured":"Seo, K., Joung, S., Lee, C., Park, S.: A closest benders cut selection scheme for accelerating the benders decomposition algorithm. INFORMS J. Comput. 34(5), 2804\u20132827 (2022)","journal-title":"INFORMS J. Comput."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-025-01472-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-025-01472-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-025-01472-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T03:53:59Z","timestamp":1743306839000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-025-01472-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,4]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["1472"],"URL":"https:\/\/doi.org\/10.1007\/s10898-025-01472-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2025,3,4]]},"assertion":[{"value":"8 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}