{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:29Z","timestamp":1740122429157,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"crossref","award":["TIN2017-84553-C2-2-R"],"award-info":[{"award-number":["TIN2017-84553-C2-2-R"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10586-018-2878-4","type":"journal-article","created":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T16:23:38Z","timestamp":1543681418000},"page":"877-886","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A scalable parallel implementation of the Cluster Benders Decomposition algorithm"],"prefix":"10.1007","volume":"22","author":[{"given":"Jordi","family":"Mateo","sequence":"first","affiliation":[]},{"given":"Llu\u00eds M.","family":"Pl\u00e0","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4830-9184","authenticated-orcid":false,"given":"Francesc","family":"Solsona","sequence":"additional","affiliation":[]},{"given":"Adela","family":"Pag\u00e8s","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,1]]},"reference":[{"key":"2878_CR1","volume-title":"Mathematical Programming: Theory and Methods","author":"SM Sinha","year":"2005","unstructured":"Sinha, S.M.: Mathematical Programming: Theory and Methods. Elsevier, Berkeley (2005)"},{"key":"2878_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.trc.2014.02.021","volume":"45","author":"G Solveling","year":"2014","unstructured":"Solveling, G., Clarke, J.-P.: Scheduling of airport runway operations using stochastic branch and bound methods. Transp. Res. Part C 45, 137\u2013199 (2014)","journal-title":"Transp. Res. Part C"},{"key":"2878_CR3","doi-asserted-by":"crossref","unstructured":"Burger, M., Graeber, B., Schindlmayr, G.: Stochastic Models for Electricity and Gas. Managing Energy Risk: A Practical Guide for Risk Management in Power, Gas and Other Energy Markets, Second Edition, 253\u2013299 (2014)","DOI":"10.1002\/9781118618509.ch6"},{"key":"2878_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.cor.2014.03.021","volume":"49","author":"F Oliveira","year":"2014","unstructured":"Oliveira, F., Grossmann, I.E., Hamacher, S.: Accelerating benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain. Comput. Oper. Res. 49, 47\u201358 (2014)","journal-title":"Comput. Oper. Res."},{"key":"2878_CR5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718799","volume-title":"Applications of Stochastic Programming","author":"S Wallace","year":"2005","unstructured":"Wallace, S., Ziemba, W.T.: Applications of Stochastic Programming. Society for Industrial Mathematics, Philadelphia (2005)"},{"key":"2878_CR6","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.V.: Introduction to Stochastic Programming, 2nd edn. Springer, New York (2011)","edition":"2"},{"issue":"4","key":"2878_CR7","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10287-010-0125-4","volume":"8","author":"JP Watson","year":"2011","unstructured":"Watson, J.P., Woodruff, D.L.: Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems. Comput. Manag. Sci. 8(4), 355\u2013370 (2011)","journal-title":"Comput. Manag. Sci."},{"key":"2878_CR8","first-page":"1","volume":"63","author":"K Kim","year":"2017","unstructured":"Kim, K., Zavala, V.M.: Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs. Math. Progr. Comput. 63, 1\u201342 (2017)","journal-title":"Math. Progr. Comput."},{"key":"2878_CR9","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.cor.2015.09.005","volume":"67","author":"LF Escudero","year":"2016","unstructured":"Escudero, L.F., Gar\u00edn, M.A., Unzueta, A.: Cluster Lagrangean Decomposition in multistage stochastic optimization. Comput. Oper. Res. 67, 48\u201362 (2016)","journal-title":"Comput. Oper. Res."},{"key":"2878_CR10","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, 238\u2013252 (1962)","journal-title":"Numer. Math."},{"issue":"3","key":"2878_CR11","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":"2878_CR12","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"R Slyke Van","year":"1969","unstructured":"Van Slyke, R., Wets, R.J.-B.: L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. 17, 638\u2013663 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"2878_CR13","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.ejor.2013.04.017","volume":"230","author":"C Wolf","year":"2013","unstructured":"Wolf, C., Koberstein, K.: Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method. Eur. J. Oper. Res. 230, 143\u2013156 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"2878_CR14","unstructured":"Rahmaniani, R., Crainic, T., Gendreau, M., Rei, W.: A Benders Decomposition method for two-stage stochastic network design problems. CIRRELT, Centre interuniversitaire de recherche sur les r\u00e9seaux d\u2019entreprise, la logistique et le transport=Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (2017)"},{"key":"2878_CR15","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s11750-011-0242-4","volume":"20","author":"L Aranburu","year":"2012","unstructured":"Aranburu, L., Escudero, L., Garin, A., Perez, G.: A so-called Cluster Benders Decomposition approach for solving two-stage stochastic linear problems. TOP 20, 279\u2013295 (2012)","journal-title":"TOP"},{"key":"2878_CR16","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10479-011-0974-4","volume":"210","author":"F You","year":"2013","unstructured":"You, F., Grossman, I.E.: Multicut Benders Decomposition algorithm for process supply chain planning under uncertainty. Ann. Oper. Res. 210, 191\u2013211 (2013)","journal-title":"Ann. Oper. Res."},{"key":"2878_CR17","unstructured":"Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual. (2018). \n                    http:\/\/www.gurobi.com"},{"key":"2878_CR18","unstructured":"IBM ILOG CPLEX V12.6. (2018). \n                    http:\/\/www-03.ibm.com\/software\/products\/en\/ibmilogcpleoptistud\/"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-2878-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-018-2878-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-2878-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T07:49:28Z","timestamp":1575272968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-018-2878-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,1]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["2878"],"URL":"https:\/\/doi.org\/10.1007\/s10586-018-2878-4","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2018,12,1]]},"assertion":[{"value":"20 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}