{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:32Z","timestamp":1740122672827,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T00:00:00Z","timestamp":1675900800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T00:00:00Z","timestamp":1675900800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10589-023-00457-4","type":"journal-article","created":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T23:30:53Z","timestamp":1675985453000},"page":"181-211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Integer set reduction for stochastic mixed-integer programming"],"prefix":"10.1007","volume":"85","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7319-1456","authenticated-orcid":false,"given":"Saravanan","family":"Venkatachalam","sequence":"first","affiliation":[]},{"given":"Lewis","family":"Ntaimo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,9]]},"reference":[{"issue":"2","key":"457_CR1","doi-asserted-by":"publisher","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\u20133","key":"457_CR2","doi-asserted-by":"publisher","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\u20133), 295\u2013324 (1993)","journal-title":"Math. Program."},{"key":"457_CR3","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.cor.2014.12.011","volume":"59","author":"E Beier","year":"2015","unstructured":"Beier, E., Venkatachalam, S., Corolli, L., Ntaimo, L.: Stage-and scenario-wise fenchel decomposition for stochastic mixed 0\u20131 programs with special structure. Comput. Oper. Res. 59, 94\u2013103 (2015)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"457_CR4","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."},{"key":"457_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to stochastic programming","author":"John R Birge","year":"2011","unstructured":"Birge, John R., Louveaux, Francois: Introduction to stochastic programming. Springer Science & Business Media, New York (2011)"},{"issue":"1","key":"457_CR6","doi-asserted-by":"publisher","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":"1","key":"457_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10852-007-9074-5","volume":"7","author":"M Boccia","year":"2008","unstructured":"Boccia, M., Sforza, A., Sterle, C., Vasilyev, I.: A cut and branch approach for the capacitated p-median problem based on fenchel cutting planes. J Math Model Algorithm 7(1), 43\u201358 (2008)","journal-title":"J Math Model Algorithm"},{"issue":"4","key":"457_CR8","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1137\/0803038","volume":"3","author":"AE Boyd","year":"1993","unstructured":"Boyd, A.E.: Generating fenchel cutting planes for knapsack polyhedra. SIAM J. Optim. 3(4), 734\u2013750 (1993)","journal-title":"SIAM J. Optim."},{"key":"457_CR9","doi-asserted-by":"crossref","unstructured":"Boyd, A.E.: Solving integer programs with fenchel cutting planes and preprocessing. In IPCO, pages 209\u2013220, (1993)","DOI":"10.21236\/ADA453863"},{"issue":"1","key":"457_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/opre.42.1.53","volume":"42","author":"AE Boyd","year":"1994","unstructured":"Boyd, A.E.: Fenchel cutting planes for integer programs. Oper. Res. 42(1), 53\u201364 (1994)","journal-title":"Oper. Res."},{"issue":"1","key":"457_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF02085635","volume":"50","author":"AE Boyd","year":"1994","unstructured":"Boyd, A.E.: Solving 0\/1 integer programs with enumeration cutting planes. Ann. Oper. Res. 50(1), 61\u201372 (1994)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"457_CR12","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0805021","volume":"5","author":"AE Boyd","year":"1995","unstructured":"Boyd, A.E.: On the convergence of fenchel cutting planes in mixed-integer programming. SIAM J. Optim. 5(2), 421\u2013435 (1995)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"457_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0167-6377(98)00050-9","volume":"24","author":"CC Caroe","year":"1999","unstructured":"Caroe, C.C., Schultz, R.: Dual decomposition in stochastic integer programming. Oper. Res. Lett. 24(1\u20132), 37\u201345 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"457_CR14","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/S0377-2217(96)00399-2","volume":"101","author":"CC Car\u00f8e","year":"1997","unstructured":"Car\u00f8e, C.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."},{"key":"457_CR15","unstructured":"CPLEX. IBM ILOG CPLEX Optimizer. https:\/\/www-01.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/, (2016)"},{"issue":"3","key":"457_CR16","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/0097-3165(73)90004-6","volume":"14","author":"GB Dantzig","year":"1973","unstructured":"Dantzig, G.B., Eaves, C.B.: Fourier-motzkin elimination and its dual. J Combinatorial Theory, Series A 14(3), 288\u2013297 (1973)","journal-title":"J Combinatorial Theory, Series A"},{"issue":"1\u20132","key":"457_CR17","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10107-012-0615-y","volume":"144","author":"Dinakar Gade","year":"2014","unstructured":"Gade, Dinakar, K\u00fc\u00e7\u00fckyavuz, Simge, Sen, Suvrajeet: Decomposition algorithms with parametric gomory cuts for two-stage stochastic integer programs. Math. Program. 144(1\u20132), 39\u201364 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"457_CR18","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF02031708","volume":"56","author":"WKK Haneveld","year":"1995","unstructured":"Haneveld, W.K.K., Stougie, L., van der Vlerk, M.H.: On the convex hull of the simple integer recourse objective function. Ann. Oper. Res. 56(1), 209\u2013224 (1995)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"457_CR19","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF02187641","volume":"64","author":"WKK Haneveld","year":"1996","unstructured":"Haneveld, W.K.K., Stougie, L., van der Vlerk, M.H.: An algorithm for the construction of convex hulls in simple integer recourse programming. Ann. Oper. Res. 64(1), 67\u201381 (1996)","journal-title":"Ann. Oper. Res."},{"key":"457_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/A:1018930113099","volume":"85","author":"WKK Haneveld","year":"1999","unstructured":"Haneveld, W.K.K., van der Vlerk, M.H.: Stochastic integer programming: general models and algorithms. Ann. Oper. Res. 85, 39\u201357 (1999)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"457_CR21","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10107-002-0322-1","volume":"94","author":"R Hemmecke","year":"2003","unstructured":"Hemmecke, R., Schultz, R.: Decomposition of test sets in stochastic integer programming. Math. Program. 94(2), 323\u2013341 (2003)","journal-title":"Math. Program."},{"key":"457_CR22","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF01585731","volume":"46","author":"K Kiwiel","year":"1990","unstructured":"Kiwiel, K.: Proximity control in bundle methods for convex nondifferentiable minimization. Math. Program. 46, 105\u2013122 (1990)","journal-title":"Math. Program."},{"issue":"2","key":"457_CR23","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s10107-006-0711-y","volume":"108","author":"N Kong","year":"2006","unstructured":"Kong, N., Schaefer, A.J., 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."},{"key":"457_CR24","doi-asserted-by":"crossref","unstructured":"K\u00fc\u00e7\u00fckyavuz, Simge, Sen, Suvrajeet.: An introduction to two-stage stochastic mixed-integer programming. In Leading Developments from INFORMS Communities, pages 1\u201327. INFORMS, (2017)","DOI":"10.1287\/educ.2017.0171"},{"issue":"3","key":"457_CR25","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.: 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":"457_CR26","doi-asserted-by":"crossref","unstructured":"Louveaux, F.V., Schultz, R.: Stochastic integer programming. In A. Ruszczynski A. Shapiro, editors, Stochastic Programming, volume 10 of Handbooks in Operations Research and Management Science, pages 213 \u2013 266. Elsevier, (2003)","DOI":"10.1016\/S0927-0507(03)10004-7"},{"key":"457_CR27","volume-title":"Integer and Combinatorial Optimization","author":"G Nemhauser","year":"1999","unstructured":"Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley-Interscience (1999)"},{"issue":"1","key":"457_CR28","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10898-011-9817-8","volume":"55","author":"L Ntaimo","year":"2013","unstructured":"Ntaimo, L.: Fenchel decomposition for stochastic mixed-integer programming. J. Global Optim. 55(1), 141\u2013163 (2013)","journal-title":"J. Global Optim."},{"issue":"1","key":"457_CR29","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/opre.1090.0693","volume":"58","author":"Lewis Ntaimo","year":"2010","unstructured":"Ntaimo, Lewis: Disjunctive decomposition for two-stage stochastic mixed-binary programs with random recourse. Oper. Res. 58(1), 229\u2013243 (2010)","journal-title":"Oper. Res."},{"key":"457_CR30","unstructured":"Gurobi Optimization. \"gurobi optimizer reference manual,\" 2014. http:\/\/www.gurobi.com, (2014)"},{"issue":"3","key":"457_CR31","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1057\/palgrave.jors.2601810","volume":"56","author":"MT Ramos","year":"2005","unstructured":"Ramos, M.T., S\u00e1ez, J.: Solving capacitated facility location problems by fenchel cutting planes. J Oper Res Soc 56(3), 297\u2013306 (2005)","journal-title":"J Oper Res Soc"},{"key":"457_CR32","doi-asserted-by":"crossref","unstructured":"R\u00f6misch, Werner, Vigerske, Stefan: Recent progress in two-stage mixed-integer stochastic programming with applications to power production planning. In Handbook of power systems I, pages 177\u2013208. Springer, (2010)","DOI":"10.1007\/978-3-642-02493-1_8"},{"issue":"3","key":"457_CR33","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1016\/S0377-2217(99)00056-9","volume":"121","author":"J S\u00e1ez","year":"2000","unstructured":"S\u00e1ez, J.: Solving linear programming relaxations associated with lagrangean relaxations by fenchel cutting planes. Eur. J. Oper. Res. 121(3), 609\u2013626 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"457_CR34","doi-asserted-by":"publisher","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":"3","key":"457_CR35","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."},{"issue":"1\u20133","key":"457_CR36","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF02680560","volume":"83","author":"R Schultz","year":"1998","unstructured":"Schultz, R., Stougie, L., van der Vlerk, M.H.: Solving stochastic programs with integer recourse by enumeration: a framework using gr\u00f6bner basis. Math. Program. 83(1\u20133), 229\u2013252 (1998)","journal-title":"Math. Program."},{"issue":"1","key":"457_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-004-0566-z","volume":"104","author":"S Sen","year":"2005","unstructured":"Sen, S., Higle, J.L.: The C3 theorem and a D2 algorithm for large scale stochastic mixed-integer programming: set convexification. Math. Program. 104(1), 1\u201320 (2005)","journal-title":"Math. Program."},{"issue":"2","key":"457_CR38","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."},{"key":"457_CR39","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/S0927-0507(05)12009-X","volume":"12","author":"Suvrajeet Sen","year":"2005","unstructured":"Sen, Suvrajeet: Algorithms for stochastic mixed-integer programming models. Handbooks Oper. Res. Management Sci. 12, 515\u2013558 (2005)","journal-title":"Handbooks Oper. Res. Management Sci."},{"issue":"2\u20133","key":"457_CR40","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10107-006-0724-6","volume":"108","author":"Hanif D Sherali","year":"2006","unstructured":"Sherali, Hanif D., Zhu, Xiaomei: On solving discrete two-stage stochastic programs having mixed-integer first-and second-stage variables. Math. Program. 108(2\u20133), 597\u2013616 (2006)","journal-title":"Math. Program."},{"key":"457_CR41","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"HD Sherali","year":"1998","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, vol. 31. Springer, New York (1998)"},{"issue":"1\u20134","key":"457_CR42","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1013827731218","volume":"22","author":"HD Sherali","year":"2002","unstructured":"Sherali, H.D., Fraticelli, B.M.: A modification of benders\u2019 decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse. J. Global Optim. 22(1\u20134), 319\u2013342 (2002)","journal-title":"J. Global Optim."},{"issue":"2","key":"457_CR43","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10107-003-0434-2","volume":"99","author":"MH van der Vlerk","year":"2004","unstructured":"van der Vlerk, M.H.: Convex approximations for complete integer recourse models. Math. Program. 99(2), 297\u2013310 (2004)","journal-title":"Math. Program."},{"issue":"4","key":"457_CR44","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"RM Van Slyke","year":"1969","unstructured":"Van Slyke, R.M., 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."},{"key":"457_CR45","unstructured":"Venkatachalam, S.: algorithms for stochastic integer programs using fenchel cutting planes. PhD thesis, Department of Systems and Industrial Engineering, Texas A &M University, USA, 2014. Available electronically from http:\/\/oaktrust.library.tamu.edu\/handle\/1969.1\/153602"},{"key":"457_CR46","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.cor.2019.02.010","volume":"106","author":"Saravanan Venkatachalam","year":"2019","unstructured":"Venkatachalam, Saravanan, Narayanan, Arunachalam: Two-stage absolute semi-deviation mean-risk stochastic programming: an application to the supply chain replenishment problem. Comput Oper Res 106, 62\u201375 (2019)","journal-title":"Comput Oper Res"},{"issue":"1","key":"457_CR47","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF01581648","volume":"19","author":"RD Wollmer","year":"1980","unstructured":"Wollmer, R.D.: Two stage linear programming under uncertainty with 0\u20131 integer first stage variables. Math. Program. 19(1), 279\u2013288 (1980)","journal-title":"Math. Program."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00457-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00457-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00457-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T16:47:09Z","timestamp":1680713229000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00457-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,9]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["457"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00457-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2023,2,9]]},"assertion":[{"value":"10 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2023","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 declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}