{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:18:08Z","timestamp":1740140288186,"version":"3.37.3"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T00:00:00Z","timestamp":1495497600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10287-017-0281-x","type":"journal-article","created":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T04:05:25Z","timestamp":1495512325000},"page":"393-421","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Regularized decomposition of large scale block-structured robust optimization problems"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9943-3572","authenticated-orcid":false,"given":"Wim","family":"van Ackooij","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Lebbe","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Malick","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,23]]},"reference":[{"issue":"1","key":"281_CR1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-012-0567-2","volume":"134","author":"C Bandi","year":"2012","unstructured":"Bandi C, Bertsimas D (2012) Tractable stochastic analysis in high dimensions via robust optimization. Math Program 134(1):23\u201370","journal-title":"Math Program"},{"issue":"6","key":"281_CR2","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1016\/j.dam.2008.06.021","volume":"157","author":"H Ben Amor","year":"2009","unstructured":"Ben Amor H, Desrosiers J, Frangioni A (2009) On the choice of explicit stabilizing terms in column generation. Discret Appl Math 157(6):1167\u20131184","journal-title":"Discret Appl Math"},{"key":"281_CR3","unstructured":"Ben-Salem S (2011) Gestion Robuste de la production \u00e9lectrique \u00e0 horizon court-terme. PhD thesis, Ecole Centrale Paris, Mars"},{"issue":"4","key":"281_CR4","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A Ben-Tal","year":"1998","unstructured":"Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math Oper Res 23(4):769\u2013805","journal-title":"Math Oper Res"},{"issue":"1","key":"281_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal A, Nemirovski A (1999) Robust solutions of uncertain linear programs. Oper Res Lett 25(1):1\u201313","journal-title":"Oper Res Lett"},{"key":"281_CR6","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust optimization. Princeton University Press, Princeton"},{"issue":"1","key":"281_CR7","doi-asserted-by":"crossref","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. Numer Math 4(1):238\u2013252","journal-title":"Numer Math"},{"issue":"1","key":"281_CR8","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10107-005-0677-1","volume":"107","author":"D Bertsimas","year":"2006","unstructured":"Bertsimas D, Sim M (2006) Tractable approximations to robust conic optimization problems. Math Program 107(1):5\u201336","journal-title":"Math Program"},{"issue":"3","key":"281_CR9","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas D, Brown D, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev 53(3):464\u2013501","journal-title":"SIAM Rev"},{"issue":"1","key":"281_CR10","doi-asserted-by":"crossref","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","journal-title":"IEEE Trans Power Syst"},{"issue":"2","key":"281_CR11","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10287-015-0236-z","volume":"13","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas D, Dunning I, Lubin M (2016) Reformulation versus cutting-planes for robust optimization. Comput Manag Sci 13(2):195\u2013217","journal-title":"Comput Manag Sci"},{"key":"281_CR12","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1109\/TPWRS.2002.807114","volume":"18","author":"A Borghetti","year":"2003","unstructured":"Borghetti A, Frangioni A, Lacalandra F, Nucci CA (2003) Lagrangian heuristics based on disaggregated bundle methods for hydrothermal unit commitment. IEEE Trans Power Syst 18:313\u2013323","journal-title":"IEEE Trans Power Syst"},{"issue":"2","key":"281_CR13","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10107-006-0079-z","volume":"113","author":"O Briant","year":"2008","unstructured":"Briant O, Lemar\u00e9chal C, Meurdesoif Ph, Michel S, Perrot N, Vanderbeck F (2008) Comparison of bundle and classical column generation. Math Program 113(2):299\u2013344","journal-title":"Math Program"},{"key":"281_CR14","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/BF02680570","volume":"83","author":"CC Caroe","year":"1998","unstructured":"Caroe CC, Tind J (1998) L-shaped decomposition of two-stage stochastic programs with integer recourse. Math Program 83:451\u2013464","journal-title":"Math Program"},{"issue":"1","key":"281_CR15","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10107-014-0808-7","volume":"152","author":"N Chatzipanagiotis","year":"2015","unstructured":"Chatzipanagiotis N, Dentcheva D, Zavlanos MM (2015) An augmented lagrangian method for distributed optimization. Math Program 152(1):405\u2013434","journal-title":"Math Program"},{"key":"281_CR16","volume-title":"Optimisation and nonsmooth analysis","author":"FH Clarke","year":"1987","unstructured":"Clarke FH (1987) Optimisation and nonsmooth analysis. Society for Industrial and Applied Mathematics, Classics in applied mathematics"},{"issue":"4","key":"281_CR17","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1287\/opre.1060.0286","volume":"54","author":"G Codato","year":"2006","unstructured":"Codato G, Fischetti M (2006) Combinatorial benders\u2019 cuts for mixed-integer linear programming. Oper Res 54(4):756\u2013766","journal-title":"Oper Res"},{"issue":"2","key":"281_CR18","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF01585170","volume":"62","author":"R Correa","year":"1993","unstructured":"Correa R, Lemar\u00e9chal C (1993) Convergence of some algorithms for convex minimization. Math Program 62(2):261\u2013275","journal-title":"Math Program"},{"key":"281_CR19","unstructured":"de Oliveira W, Eckstein J (2015) A bundle method for exploiting additive structure in difficult optimization problems, pp 1\u201318. http:\/\/www.optimization-online.org\/DB_HTML\/2015\/05\/4935.html"},{"issue":"6","key":"281_CR20","doi-asserted-by":"crossref","first-page":"1180","DOI":"10.1080\/10556788.2013.871282","volume":"29","author":"W Oliveira de","year":"2014","unstructured":"de Oliveira W, Sagastiz\u00e1bal C (2014) Level bundle methods for oracles with on demand accuracy. Optim Methods Softw 29(6):1180\u20131209","journal-title":"Optim Methods Softw"},{"issue":"2","key":"281_CR21","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1137\/100808289","volume":"21","author":"W Oliveira de","year":"2011","unstructured":"de Oliveira W, Sagastiz\u00e1bal CA, Scheimberg S (2011) Inexact bundle methods for two-stage stochastic programming. SIAM J Optim 21(2):517\u2013544","journal-title":"SIAM J Optim"},{"key":"281_CR22","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s10107-014-0809-6","volume":"148","author":"W Oliveira de","year":"2014","unstructured":"de Oliveira W, Sagastiz\u00e1bal C, Lemar\u00e9chal C (2014) Convex proximal bundle methods in depth: a unified analysis for inexact oracles. Math Prog Ser B 148:241\u2013277","journal-title":"Math Prog Ser B"},{"issue":"1","key":"281_CR23","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10107-005-0593-4","volume":"104","author":"L Dubost","year":"2005","unstructured":"Dubost L, Gonzalez R, Lemar\u00e9chal C (2005) A primal-proximal heuristic applied to french unitcommitment problem. Math Program 104(1):129\u2013151","journal-title":"Math Program"},{"issue":"4","key":"281_CR24","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/S0895479896298130","volume":"18","author":"L Ghaoui El","year":"2006","unstructured":"El Ghaoui L, Lebret H (2006) Robust solutions to least-squares problems with uncertain data. SIAM J Matrix Anal Appl 18(4):1035\u20131064","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"1","key":"281_CR25","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1052623496305717","volume":"9","author":"L Ghaoui El","year":"1998","unstructured":"El Ghaoui L, Oustry F, Lebret H (1998) Robust solutions to uncertain semidefinite programs. SIAM J Optim 9(1):33\u201352","journal-title":"SIAM J Optim"},{"issue":"3","key":"281_CR26","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S1052623498332336","volume":"10","author":"S Feltenmark","year":"2000","unstructured":"Feltenmark S, Kiwiel KC (2000) Dual applications of proximal bundle methods, including lagrangian relaxation of nonconvex problems. SIAM J Optim 10(3):697\u2013721","journal-title":"SIAM J Optim"},{"key":"281_CR27","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/j.ijepes.2010.12.013","volume":"33","author":"A Frangioni","year":"2011","unstructured":"Frangioni A, Gentile C, Lacalandra F (2011) Sequential Lagrangian-MILP approaches for unit commitment problems. Int J Electr Power Energy Syst 33:585\u2013593","journal-title":"Int J Electr Power Energy Syst"},{"issue":"4","key":"281_CR28","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"AM Geoffrion","year":"1972","unstructured":"Geoffrion AM (1972) Generalized benders decomposition. J Optim Theory Appl 10(4):237\u2013260","journal-title":"J Optim Theory Appl"},{"issue":"2","key":"281_CR29","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1137\/15M1036592","volume":"27","author":"S Guo","year":"2017","unstructured":"Guo S, Xu H, Zhang L (2017) Convergence analysis for mathematical programs with distributionally robust chance constraint. SIAM J Optim 27(2):784\u2013816","journal-title":"SIAM J Optim"},{"issue":"1","key":"281_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-015-9762-4","volume":"63","author":"W Hare","year":"2016","unstructured":"Hare W, Sagastiz\u00e1bal C, Solodov M (2016) A proximal bundle method for nonconvex functions with inexact oracles. Comput Optim Appl 63(1):1\u201328","journal-title":"Comput Optim Appl"},{"issue":"6","key":"281_CR31","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1016\/j.orl.2006.12.008","volume":"35","author":"H Heitsch","year":"2007","unstructured":"Heitsch H, R\u00f6misch W (2007) A note on scenario reduction for two-stage stochastic programs. Oper Res Lett 35(6):731\u2013738","journal-title":"Oper Res Lett"},{"key":"281_CR32","unstructured":"Hiriart-Urruty JB, Lemar\u00e9chal C (1996a) Convex analysis and minimization algorithms II. Number 306 in Grundlehren der mathematischen Wissenschaften, 2nd edn. Springer, Berlin"},{"key":"281_CR33","unstructured":"Hiriart-Urruty JB, Lemar\u00e9chal C (1996b) Convex analysis and minimization algorithms I. Number 305 in Grundlehren der mathematischen Wissenschaften, 2nd edn. Springer, Berlin"},{"key":"281_CR34","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"JN Hooker","year":"2003","unstructured":"Hooker JN, Ottosson G (2003) Logic-based benders decomposition. Math. Program 96:33\u201360","journal-title":"Program"},{"issue":"4","key":"281_CR35","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"JE Kelley","year":"1960","unstructured":"Kelley JE (1960) The cutting-plane method for solving convex programs. J Soc Ind Appl Math 8(4):703\u2013712","journal-title":"J Soc Ind Appl Math"},{"issue":"2","key":"281_CR36","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1093\/imanum\/6.2.137","volume":"6","author":"KC Kiwiel","year":"1986","unstructured":"Kiwiel KC (1986) A method for solving certain quadratic programming problems arising in non-smooth optimization. IMA J Numer Anal 6(2):137\u2013152","journal-title":"IMA J Numer Anal"},{"key":"281_CR37","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s002110050065","volume":"68","author":"KC Kiwiel","year":"1994","unstructured":"Kiwiel KC (1994) A cholesky dual method for proximal piecewise linear programming. Numer Math 68:325\u2013340","journal-title":"Numer Math"},{"issue":"4","key":"281_CR38","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1137\/040603929","volume":"16","author":"KC Kiwiel","year":"2006","unstructured":"Kiwiel KC (2006) A proximal bundle method with approximate subgradient linearizations. SIAM J Optim 16(4):1007\u20131023","journal-title":"SIAM J Optim"},{"issue":"2","key":"281_CR39","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10852-005-9015-0","volume":"5","author":"A Kolokolov","year":"2006","unstructured":"Kolokolov A, Kosarev N (2006) Analysis of decomposition algorithms with benders cuts for $$p$$ p -median problem. J Math Model Algorithms 5(2):189\u2013199","journal-title":"J Math Model Algorithms"},{"key":"281_CR40","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BFb0120700","volume":"3","author":"C Lemar\u00e9chal","year":"1975","unstructured":"Lemar\u00e9chal C (1975) An extension of davidon methods to nondifferentiable problems. Math Program Study 3:95\u2013109","journal-title":"Math Program Study"},{"issue":"1","key":"281_CR41","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01585555","volume":"69","author":"C Lemar\u00e9chal","year":"1995","unstructured":"Lemar\u00e9chal C, Nemirovskii A, Nesterov Y (1995) New variants of bundle methods. Math Program 69(1):111\u2013147","journal-title":"Math Program"},{"issue":"1","key":"281_CR42","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s13675-015-0060-9","volume":"5","author":"J Malick","year":"2017","unstructured":"Malick J, de Oliveira W, Zaourar S (2017) Uncontrolled inexact information within bundle methods. EURO J Comput Optim 5(1):5\u201329","journal-title":"EURO J Comput Optim"},{"key":"281_CR43","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1051\/ro\/2014017","volume":"48","author":"M Minoux","year":"2014","unstructured":"Minoux M (2014) Two-stage robust optimization, state-space representable uncertainty and applications. RAIRO-Oper Res 48:455\u2013475","journal-title":"RAIRO-Oper Res"},{"issue":"2","key":"281_CR44","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1515\/156939603322663321","volume":"9","author":"G Pag\u00e8s","year":"2003","unstructured":"Pag\u00e8s G, Printems J (2003) Optimal quadratic quantization for numerics: the Gaussian case. Monte Carlo Methods Appl 9(2):135\u2013166","journal-title":"Monte Carlo Methods Appl"},{"key":"281_CR45","unstructured":"Rockafellar RT, Wets RJ-B (2009) Variational analysis, volume 317 of Grundlehren der mathematischen Wissenschaften, 3rd edn. Springer, Berlin"},{"key":"281_CR46","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1111\/j.1475-3995.2009.00706.x","volume":"17","author":"GKD Sahiridis","year":"2010","unstructured":"Sahiridis GKD, Minoux M, Ierapetritou MG (2010) Accelerating benders method using covering cut bundle generation. Int Trans Oper Res 17:221\u2013237","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"281_CR47","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10479-011-0883-6","volume":"210","author":"HD Sherali","year":"2013","unstructured":"Sherali HD, Lunday BJ (2013) On generating maximal nondominated benders cuts. Ann Oper Res 210(1):57\u201372","journal-title":"Ann Oper Res"},{"issue":"3","key":"281_CR48","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1137\/140967337","volume":"25","author":"Y Song","year":"2015","unstructured":"Song Y, Luedtke J (2015) An adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse. SIAM J Optim 25(3):1344\u20131367","journal-title":"SIAM J Optim"},{"key":"281_CR49","doi-asserted-by":"crossref","unstructured":"Tahanan M, van Ackooij W, Frangioni A, Lacalandra F (2015) Large-scale unit commitment under uncertainty: a literature survey. 4OR 13(2):115\u2013171","DOI":"10.1007\/s10288-014-0279-y"},{"issue":"1","key":"281_CR50","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/59.852114","volume":"15","author":"S Takriti","year":"2000","unstructured":"Takriti S, Birge JR (2000) Using integer programming to refine lagrangian-based unit commitment solutions. IEEE Trans Power Syst 15(1):151\u2013156","journal-title":"IEEE Trans Power Syst"},{"issue":"3","key":"281_CR51","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s00186-014-0478-5","volume":"80","author":"W Ackooij van","year":"2014","unstructured":"van Ackooij W (2014) Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment. Math Methods Oper Res 80(3):227\u2013253","journal-title":"Math Methods Oper Res"},{"issue":"1","key":"281_CR52","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s13675-015-0051-x","volume":"5","author":"W Ackooij van","year":"2017","unstructured":"van Ackooij W (2017) A comparison of four approaches from stochastic programming for large-scale unit-commitment. EURO J Comput Optim 5(1):119\u2013147","journal-title":"EURO J Comput Optim"},{"issue":"3","key":"281_CR53","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/s10589-013-9610-3","volume":"57","author":"W Ackooij van","year":"2014","unstructured":"van Ackooij W, de Oliveira W (2014) Level bundle methods for constrained convex optimization with various oracles. Comput Optim Appl 57(3):555\u2013597","journal-title":"Comput Optim Appl"},{"issue":"2","key":"281_CR54","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1137\/120903099","volume":"24","author":"W Ackooij van","year":"2014","unstructured":"van Ackooij W, Sagastiz\u00e1bal C (2014) Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems. SIAM J Optim 24(2):733\u2013765","journal-title":"SIAM J Optim"},{"key":"281_CR55","unstructured":"van Ackooij W, Frangioni A (2016) Incremental bundle methods using upper models. Submitted paper; Technical report, pp 1\u201325. http:\/\/eprints.adm.unipi.it\/2357\/"},{"issue":"1","key":"281_CR56","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10479-015-2029-8","volume":"238","author":"W Ackooij van","year":"2016","unstructured":"van Ackooij W, Malick J (2016) Decomposition algorithm for large-scale two-stage unit-commitment. Ann Oper Res 238(1):587\u2013613","journal-title":"Ann Oper Res"},{"key":"281_CR57","first-page":"509","volume":"15","author":"W Ackooij van","year":"2014","unstructured":"van Ackooij W, Henrion R, M\u00f6ller A, Zorgati R (2014) Joint chance constrained programming for hydro reservoir management. Optim Eng 15:509\u2013531","journal-title":"Optim Eng"},{"issue":"3","key":"281_CR58","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1007\/s10589-016-9851-z","volume":"65","author":"W Ackooij van","year":"2016","unstructured":"van Ackooij W, Frangioni A, de Oliveira W (2016a) Inexact stabilized Benders\u2019 decomposition approaches: with application to chance-constrained problems with finite support. Comput Optim Appl 65(3):637\u2013669","journal-title":"Comput Optim Appl"},{"key":"281_CR59","unstructured":"van Ackooij W, de\u00a0Oliveira W, Song Y (2016b) An adaptive partition-based level decomposition for solving two-stage stochastic programs with fixed recourse. Informs J Comput 1\u201318 (to appear)"},{"key":"281_CR60","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.cor.2016.08.002","volume":"77","author":"W Ackooij van","year":"2017","unstructured":"van Ackooij W, Berge V, de Oliveira W, Sagastiz\u00e1bal C (2017) Probabilistic optimization via approximate p-efficient points and bundle methods. Comput Oper Res 77:177\u2013193","journal-title":"Comput Oper Res"},{"issue":"1","key":"281_CR61","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s10479-012-1102-9","volume":"210","author":"J Dinter Van","year":"2013","unstructured":"Van Dinter J, Rebenack S, Kallrath J, Denholm P, Newman A (2013) The unit commitment model with concave emissions costs: a hybrid benders\u2019 decomposition with nonconvex master problems. Ann Oper Res 210(1):361\u2013386","journal-title":"Ann Oper Res"},{"key":"281_CR62","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"RM Slyke van","year":"1969","unstructured":"van Slyke RM, Wets RJ-B (1969) L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J Appl Math 17:638\u2013663","journal-title":"SIAM J Appl Math"},{"issue":"2","key":"281_CR63","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF01194335","volume":"44","author":"P Wentges","year":"1996","unstructured":"Wentges P (1996) Accelerating benders\u2019 decomposition for the capacitated facility location problem. Math Methods Oper Res 44(2):267\u2013290","journal-title":"Math Methods Oper Res"},{"key":"281_CR64","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.compchemeng.2012.04.015","volume":"44","author":"Y Yang","year":"2012","unstructured":"Yang Y, Lee JM (2012) A tighter cut generation strategy for acceleration of benders decomposition. Comput Chem Eng 44:84\u201393","journal-title":"Comput Chem Eng"},{"issue":"3","key":"281_CR65","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1137\/S1052623497318700","volume":"10","author":"G Zakeri","year":"2000","unstructured":"Zakeri G, Philpott A, Ryan DM (2000) Inexact cuts in benders decomposition. SIAM J Optim 10(3):643\u2013657","journal-title":"SIAM J Optim"},{"key":"281_CR66","unstructured":"Zaourar S (2014) Optimisation convexe non-diff\u00e9rentiable et m\u00e9thodes de d\u00e9composition en recherche op\u00e9rationnelle. PhD thesis, University of Grenoble"},{"key":"281_CR67","first-page":"1","volume-title":"Quadratic stabilization of benders decomposition","author":"S Zaourar","year":"2014","unstructured":"Zaourar S, Malick J (2014) Quadratic stabilization of benders decomposition. Privately communicated, Draft submitted, pp 1\u201322"},{"issue":"5","key":"281_CR68","doi-asserted-by":"crossref","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","journal-title":"Oper Res Lett"},{"issue":"3","key":"281_CR69","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s12532-012-0038-z","volume":"4","author":"V Zverovich","year":"2012","unstructured":"Zverovich V, F\u00e1bi\u00e1n CI, Ellison EFD, Mitra G (2012) A computational study of a solver system for processing two-stage stochastic lps with enhanced benders decomposition. Math Program Comput 4(3):211\u2013238","journal-title":"Math Program Comput"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-017-0281-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-017-0281-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-017-0281-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T19:34:50Z","timestamp":1569353690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-017-0281-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,23]]},"references-count":69,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["281"],"URL":"https:\/\/doi.org\/10.1007\/s10287-017-0281-x","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"type":"print","value":"1619-697X"},{"type":"electronic","value":"1619-6988"}],"subject":[],"published":{"date-parts":[[2017,5,23]]}}}