{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T21:01:00Z","timestamp":1780606860398,"version":"3.54.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,11,30]],"date-time":"2012-11-30T00:00:00Z","timestamp":1354233600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s10107-012-0615-y","type":"journal-article","created":{"date-parts":[[2012,11,29]],"date-time":"2012-11-29T08:24:53Z","timestamp":1354177493000},"page":"39-64","source":"Crossref","is-referenced-by-count":73,"title":["Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs"],"prefix":"10.1007","volume":"144","author":[{"given":"Dinakar","family":"Gade","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simge","family":"K\u00fc\u00e7\u00fckyavuz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Suvrajeet","family":"Sen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,11,30]]},"reference":[{"issue":"1","key":"615_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP solving constraint integer programs. Math. Program. Comput. 1(1), 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"615_CR2","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10107-003-0475-6","volume":"100","author":"S Ahmed","year":"2004","unstructured":"Ahmed, S., Tawarmalani, M., Sahinidis, N.: A finite branch-and-bound algorithm for two-stage stochastic integer programs. Math. Program. 100(2), 355\u2013377 (2004)","journal-title":"Math. Program."},{"issue":"1","key":"615_CR3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Math. Program. 58(1), 295\u2013324 (1993)","journal-title":"Math. Program."},{"issue":"1","key":"615_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(96)00007-7","volume":"19","author":"E Balas","year":"1996","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G., Natraj, N.: Gomory cuts revisited. Oper. Res. Lett. 19(1), 1\u20139 (1996)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"615_CR5","doi-asserted-by":"crossref","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":"615_CR6","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/0377-2217(88)90159-2","volume":"34","author":"J Birge","year":"1988","unstructured":"Birge, J., Louveaux, F.: A multicut algorithm for two-stage stochastic linear programs. Eur. J. Oper. Res. 34(3), 384\u2013392 (1988)","journal-title":"Eur. J. Oper. Res."},{"key":"615_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to stochastic programming","author":"J Birge","year":"2011","unstructured":"Birge, J., Louveaux, F.: Introduction to stochastic programming, 2nd edn. Springer, Berlin (2011)","edition":"2"},{"issue":"1","key":"615_CR8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10479-006-0091-y","volume":"149","author":"R Bixby","year":"2007","unstructured":"Bixby, R., Rothberg, E.: Progress in computational mixed integer programming: a look back from the other side of the tipping point. Ann. Oper. Res. 149(1), 37\u201341 (2007)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"615_CR9","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF01583794","volume":"23","author":"C Blair","year":"1982","unstructured":"Blair, C., Jeroslow, R.: The value function of an integer program. Math. Program. 23(1), 237\u2013273 (1982)","journal-title":"Math. Program."},{"issue":"3","key":"615_CR10","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.1080.0370","volume":"34","author":"V Borozan","year":"2009","unstructured":"Borozan, V., Cornu\u00e9jols, G.: Minimal valid inequalities for integer constraints. Math. Oper. Res. 34(3), 538\u2013546 (2009)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"615_CR11","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/S0377-2217(96)00399-2","volume":"101","author":"C Car\u00f8e","year":"1997","unstructured":"Car\u00f8e, C., Tind, J.: A cutting-plane approach to mixed 0\u20131 stochastic integer programs. Eur. J. Oper. Res. 101(2), 306\u2013316 (1997)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"615_CR12","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/BF02680570","volume":"83","author":"C Car\u00f8e","year":"1998","unstructured":"Car\u00f8e, C., Tind, J.: L-shaped decomposition of two-stage stochastic programs with integer recourse. Math. Program. 83(1), 451\u2013464 (1998)","journal-title":"Math. Program."},{"issue":"1","key":"615_CR13","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1287\/opre.1100.0882","volume":"59","author":"B Chen","year":"2011","unstructured":"Chen, B., K\u00fc\u00e7\u00fckyavuz, S., Sen, S.: Finite disjunctive programming characterizations for general mixed-integer linear programs. Oper. Res. 59(1), 202\u2013210 (2011)","journal-title":"Oper. Res."},{"key":"615_CR14","unstructured":"Chv\u00e0tal, V.: Edmonds polytopes and a hierarchy of combinatorial problems. Discret. Math. 4(4), 305\u2013337 (1973)"},{"key":"615_CR15","unstructured":"Gade, D.: Algorithms and Reformulations for Large-Scale Integer and Stochastic Integer Programs. Ph.D. Thesis, The Ohio State University (2012)"},{"issue":"5","key":"615_CR16","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"R Gomory","year":"1958","unstructured":"Gomory, R.: Outline of an algorithm for integer solutions to linear programs. Bull. Am. Math. Soc. 64(5), 275\u2013278 (1958)","journal-title":"Bull. Am. Math. Soc."},{"key":"615_CR17","unstructured":"Gomory, R.: An Algorithm for the Mixed Integer Problem. Tech. Rep. RM-2597, RAND Corporation (1960)"},{"issue":"4","key":"615_CR18","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"R Gomory","year":"1969","unstructured":"Gomory, R.: Some polyhedra related to combinatorial problems. Linear Algebra Appl. 2(4), 451\u2013558 (1969)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"615_CR19","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10107-006-0711-y","volume":"108","author":"N Kong","year":"2006","unstructured":"Kong, N., Schaefer, A., Hunsaker, B.: Two-stage integer programs with stochastic right-hand sides: a superadditive dual approach. Math. Program. 108(2), 275\u2013296 (2006)","journal-title":"Math. Program."},{"issue":"3","key":"615_CR20","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90002-X","volume":"13","author":"G Laporte","year":"1993","unstructured":"Laporte, G., Louveaux, F.: 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":"615_CR21","doi-asserted-by":"crossref","unstructured":"Louveaux, F., Schultz, R.: Stochastic integer programming. In: Shapiro, A., Ruszczy\u0144ski, A. (eds.) Stochastic Programming, Handbooks in Operations Research and Management Science, vol. 10, pp. 213\u2013266. Elsevier, Amsterdam (2003)","DOI":"10.1016\/S0927-0507(03)10004-7"},{"issue":"3","key":"615_CR22","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1006\/jcom.1997.0447","volume":"13","author":"E Mayr","year":"1997","unstructured":"Mayr, E.: Some complexity results for polynomial ideals. J. Complex. 13(3), 303\u2013325 (1997)","journal-title":"J. Complex."},{"key":"615_CR23","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G Nemhauser","year":"1988","unstructured":"Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"issue":"4","key":"615_CR24","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0167-6377(82)90014-1","volume":"1","author":"F Nourie","year":"1982","unstructured":"Nourie, F., Venta, E.: An upper bound on the number of cuts needed in Gomory\u2019s method of integer forms. Oper. Res. Lett. 1(4), 129\u2013133 (1982)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"615_CR25","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/opre.1090.0693","volume":"58","author":"L Ntaimo","year":"2010","unstructured":"Ntaimo, L.: Disjunctive decomposition for two-stage stochastic mixed-binary programs with random recourse. Oper. Res. 58(1), 229\u2013243 (2010)","journal-title":"Oper. Res."},{"issue":"3","key":"615_CR26","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s10898-004-5910-6","volume":"32","author":"L Ntaimo","year":"2005","unstructured":"Ntaimo, L., Sen, S.: The million-variable march for stochastic combinatorial optimization. J. Global Optim. 32(3), 385\u2013400 (2005)","journal-title":"J. Global Optim."},{"issue":"3","key":"615_CR27","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10589-007-9085-1","volume":"40","author":"L Ntaimo","year":"2008","unstructured":"Ntaimo, L., Sen, S.: A comparative study of decomposition algorithms for stochastic combinatorial optimization. Comput. Optim. Appl. 40(3), 299\u2013319 (2008)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"615_CR28","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1287\/moor.18.3.578","volume":"18","author":"R Schultz","year":"1993","unstructured":"Schultz, R.: Continuity properties of expectation functions in stochastic integer programming. Math. Oper. Res. 18(3), 578\u2013589 (1993)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"615_CR29","first-page":"229","volume":"83","author":"R Schultz","year":"1998","unstructured":"Schultz, R., Stougie, L., van der Vlerk, M.: Solving stochastic programs with integer recourse by enumeration: a framework using Gr\u00f6bner basis. Math. Program. 83(1), 229\u2013252 (1998)","journal-title":"Math. Program."},{"key":"615_CR30","doi-asserted-by":"crossref","unstructured":"Sen, S.: Algorithms for stochastic mixed-integer programming models. In: Aardal, K., Nemhauser, G., Weismantel, R. (eds.) Discrete Optimization, Handbooks in Operations Research and Management Science, vol. 12, pp. 515\u2013558. Elsevier, Amsterdam (2003)","DOI":"10.1016\/S0927-0507(05)12009-X"},{"issue":"1","key":"615_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-004-0566-z","volume":"104","author":"S Sen","year":"2005","unstructured":"Sen, S., Higle, J.: The $${C}^3$$ theorem and a $${D}^2$$ algorithm for large scale stochastic mixed-integer programming: set convexification. Math. Program. 104(1), 1\u201320 (2005)","journal-title":"Math. Program."},{"key":"615_CR32","doi-asserted-by":"crossref","unstructured":"Sen, S., Higle, J., Ntaimo, L.: A summary and illustration of disjunctive decomposition with set convexification. In: Woodruff, D. (ed.) Network Interdiction and Stochastic Integer Programming, pp. 105\u2013125. Springer, Berlin (2003)","DOI":"10.1007\/0-306-48109-X_6"},{"issue":"1","key":"615_CR33","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/BF02591860","volume":"31","author":"S Sen","year":"1985","unstructured":"Sen, S., Sherali, H.: On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs. Math. Program. 31(1), 42\u201356 (1985)","journal-title":"Math. Program."},{"issue":"2","key":"615_CR34","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s10107-005-0592-5","volume":"106","author":"S Sen","year":"2006","unstructured":"Sen, S., Sherali, H.: Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming. Math. Program. 106(2), 203\u2013223 (2006)","journal-title":"Math. Program."},{"key":"615_CR35","doi-asserted-by":"crossref","unstructured":"Sherali, H., Adams, W.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, Nonconvex Optimization and its Applications, vol. 31. Kluwer, Dordrecht (1999)","DOI":"10.1007\/978-1-4757-4388-3"},{"issue":"1","key":"615_CR36","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1023\/A:1013827731218","volume":"22","author":"H Sherali","year":"2002","unstructured":"Sherali, H., Fraticelli, B.: A modification of Benders\u2019 decomposition algorithm for discrete subproblems: an approach for stochastic programs with integer recourse. J. Global Optim. 22(1), 319\u2013342 (2002)","journal-title":"J. Global Optim."},{"issue":"2","key":"615_CR37","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s10107-006-0724-6","volume":"108","author":"H Sherali","year":"2006","unstructured":"Sherali, H., Zhu, X.: On solving discrete two-stage stochastic programs having mixed-integer first-and second-stage variables. Math. Program. 108(2), 597\u2013616 (2006)","journal-title":"Math. Program."},{"issue":"4","key":"615_CR38","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"R Slyke Van","year":"1969","unstructured":"Van Slyke, R., Wets, R.: L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. 17(4), 638\u2013663 (1969)","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"615_CR39","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1287\/ijoc.1080.0300","volume":"21","author":"Y Yuan","year":"2009","unstructured":"Yuan, Y., Sen, S.: Enhanced cut generation methods for decomposition-based branch and cut for two-stage stochastic mixed-integer programs. INFORMS J. Comput. 21(3), 480\u2013487 (2009)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"615_CR40","first-page":"1","volume":"130","author":"A Zanette","year":"2010","unstructured":"Zanette, A., Fischetti, M., Balas, E.: Lexicography and degeneracy: can a pure cutting plane algorithm work? Math. Program. 130(1), 1\u201324 (2010)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0615-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0615-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0615-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,6]],"date-time":"2019-07-06T02:31:26Z","timestamp":1562380286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0615-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,30]]},"references-count":40,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["615"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0615-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,30]]}}}