{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T22:30:36Z","timestamp":1772317836544,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1023\/a:1013827731218","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T18:50:27Z","timestamp":1041101427000},"page":"319-342","source":"Crossref","is-referenced-by-count":108,"title":["A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse"],"prefix":"10.1007","volume":"22","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara M.P.","family":"Fraticelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"384220_CR1","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01581249","volume":"59","author":"W.P. Adams","year":"1993","unstructured":"Adams, W.P. and H.D. Sherali (1993), Mixed-Integer Bilinear Programming Problems. Mathematical Programming\n59(3), 279\u2013305.","journal-title":"Mathematical Programming"},{"key":"384220_CR2","volume-title":"A Finite Branch and Bound Algorithm for Two-Stage Stochastic Integer Programs","author":"S. Ahmed","year":"2000","unstructured":"Ahmed, S., M. Tawarmalani, and N.V. Sahindis (2000), A Finite Branch and Bound Algorithm for Two-Stage Stochastic Integer Programs. Working paper, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA."},{"key":"384220_CR3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas, E., S. Ceria and G. Cornuejols (1993), A Lift-and-Project Cutting Plane Algorithms for Mixed 0\u20131 Programs. Mathematical Programming\n58, 295\u2013324.","journal-title":"Mathematical Programming"},{"issue":"3\u20134","key":"384220_CR4","first-page":"417","volume":"9","author":"J.R. Birge","year":"1966","unstructured":"Birge, J.R. and M.A.H. Dempster (1966), Stochastic Programming Approaches to Stochastic Scheduling, Journal of Global Optimization\n9(3\u20134), 417\u2013451.","journal-title":"Journal of Global Optimization"},{"issue":"3","key":"384220_CR5","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/0377-2217(88)90159-2","volume":"34","author":"J.R. Birge","year":"1988","unstructured":"Birge, J.R. and F.V. Louveaux (1988), A Multicut Algorithm for Two-Stage Stochastic Linear Programs. European Journal of Operational Research\n34(3), 384\u2013392.","journal-title":"European Journal of Operational Research"},{"key":"384220_CR6","volume-title":"Introduction to Stochastic Programming","author":"J.R. Birge","year":"1997","unstructured":"Birge, J.R. and F.V. Louveaux (1997), Introduction to Stochastic Programming. New York, NY: Springer."},{"issue":"1","key":"384220_CR7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1287\/inte.24.1.29","volume":"24","author":"D.R. Carino","year":"1994","unstructured":"Carino, D.R., T. Kent, D.H. Meyers, C. Stacy, M. Sylvanus, A.L. Turner, K. Watanabe, and W.T. Ziemba (1994), The Russell-Yasuda Kasai Model: An Asset \/ Liability Model for a Japanese Insurance Company Using Multistage Stochastic Programming. Interfaces\n24(1), 29\u201349.","journal-title":"Interfaces"},{"issue":"1","key":"384220_CR8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0167-6377(98)00050-9","volume":"24","author":"C.C. Caroe","year":"1999","unstructured":"Caroe, C.C. and R. Schultz (1999), Dual Decomposition in Stochastic Integer Programming. Operations Research Letters\n24(1), 37\u201345.","journal-title":"Operations Research Letters"},{"issue":"2","key":"384220_CR9","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/S0377-2217(96)00399-2","volume":"101","author":"C.C. Caroe","year":"1997","unstructured":"Caroe, C.C. and J. Tind (1997), A Cutting-Plane Approach to Mixed 0\u20131 Stochastic Integer Programs. European Journal of Operational Research\n101(2), 306\u2013316.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"384220_CR10","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/BF02680570","volume":"83","author":"C.C. Caroe","year":"1998","unstructured":"Caroe, C.C. and J. Tind (1998), L-Shaped Decomposition of two-Stage Stochastic Programs with Integer Recourse. Mathematical Programming\n83(3), 451\u2013464.","journal-title":"Mathematical Programming"},{"issue":"1","key":"384220_CR11","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1080\/05695557808975181","volume":"10","author":"A. Geoffrion","year":"1978","unstructured":"Geoffrion, A. and R. McBride (1978), Lagrangean Relaxation Applied to Capacitated Facility Location Problems. AIIE Transactions\n10(1), 40\u201347.","journal-title":"AIIE Transactions"},{"issue":"3","key":"384220_CR12","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1287\/moor.16.3.650","volume":"16","author":"J.L. Higle","year":"1991","unstructured":"Higle, J.L. and S. Sen (1991), Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse. Mathematics of Operations Research\n16(3), 650\u2013669.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"384220_CR13","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/opre.42.2.311","volume":"42","author":"J.L. Higle","year":"1994","unstructured":"Higle, J.L. and S. Sen (1994), Conditional Stochastic Decomposition: An Algorithmic Interface for Optimization and Simulation. Operations Research\n42(2), 311\u2013322.","journal-title":"Operations Research"},{"key":"384220_CR14","volume-title":"The C Theorem and a D Algorithm for Large Scale Stochastic Integer Programming: Set Convexification","author":"J.L. Higle","year":"2000","unstructured":"Higle, J.L. and S. Sen (2000), The C Theorem and a D Algorithm for Large Scale Stochastic Integer Programming: Set Convexification. Working paper, Department of Systems and Industrial Engineering, The University of Arizona, Tucson, AZ 85721. Also presented at the 17th International Symposium on Mathematical Programming, Atlanta, GA, August 7\u201311, 2000."},{"issue":"3","key":"384220_CR15","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/0318018","volume":"18","author":"R. Jeroslow","year":"1980","unstructured":"Jeroslow, R. (1980), A Cutting Plane Game for Facial Disjunctive Programs. SIAM Journal on Control and Optimization\n18(3), 264\u2013280.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"384220_CR16","volume-title":"Stochastic Programming","author":"P. Kall","year":"1994","unstructured":"Kall, P. and S.W. Wallace (1994), Stochastic Programming. Chichester, England: John Wiley and Sons."},{"key":"384220_CR17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02187641","volume":"64","author":"W.K. Klein Haneveld","year":"1996","unstructured":"Klein Haneveld, W.K., L. Stougie, and M.H. van der Vlerk (1996), An Algorithm for the Construction of Convex Hulls in Simple Integer Recourse Programming. Annals of Operations Research\n64, 67\u201381.","journal-title":"Annals of Operations Research"},{"key":"384220_CR18","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1023\/A:1018930113099","volume":"85","author":"W.K. Klein Haneveld","year":"1999","unstructured":"Klein Haneveld, W.K. and M.H. van der Vlerk (1999), Stochastic Integer Programming: General Models and Algorithms. Annals of Operations Research\n85, 39\u201357.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"384220_CR19","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. and F.V. Louveaux (1993), The Integer L-Shaped Method for Stochastic Integer Programs with Complete Recourse. Operations Research Letters\n13(3), 133\u2013142.","journal-title":"Operations Research Letters"},{"issue":"3","key":"384220_CR20","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/trsc.26.3.161","volume":"26","author":"G. Laporte","year":"1992","unstructured":"Laporte, G., F.V. Louveaux, and H. Mercure (1992), The Vehicle Routing Problem with Stochastic Travel Times. Transportation Science\n26(3), 161\u2013170.","journal-title":"Transportation Science"},{"issue":"2","key":"384220_CR21","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1287\/trsc.28.2.95","volume":"28","author":"G. Laporte","year":"1994","unstructured":"Laporte, G., F.V. Louveaux, and L. van Hamme (1994), Exact Solution of a Stochastic Location Problem b an Integer L-Shaped Algorithm. Transportation Science\n28(2), 95\u2013103.","journal-title":"Transportation Science"},{"key":"384220_CR22","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1080\/05695558208975038","volume":"14","author":"F.H. Murphy","year":"1982","unstructured":"Murphy, F.H., S. Sen, and A.L. Soyster (1982), Electric Utility Capacity Expansion Planning with Uncertain Load Forecasts. AIIE Transactions\n14, 52\u201359.","journal-title":"AIIE Transactions"},{"key":"384220_CR23","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1999","unstructured":"Nemhauser, G.L. and L.A. Wolsey (1999), Integer and Combinatorial Optimization. New York, NY: Wiley-Interscience."},{"key":"384220_CR24","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1023\/A:1018965626303","volume":"85","author":"A. Ruszczynski","year":"1999","unstructured":"Ruszczynski, A. (1999), Some Advances in Decomposition Methods for Stochastic Linear Programming. Annals of Operations Research\n85, 153\u2013172.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"384220_CR25","first-page":"73","volume":"70","author":"R. Schultz","year":"1995","unstructured":"Schultz, R. (1995), On Structure and Stability in Stochastic Programs with Random Technology Matrix and Complete Integer Recourse. Mathematical Programming\n70(1), 73\u201390.","journal-title":"Mathematical Programming"},{"issue":"3","key":"384220_CR26","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1111\/j.1467-9574.1996.tb01506.x","volume":"50","author":"R. Schultz","year":"1996","unstructured":"Schultz, R., L. Stougie, and M.H. van der Vlerk (1996), Two-Stage Stochastic Integer Programming: A Survey. Statistica Neerlandica\n50(3), 404\u2013416.","journal-title":"Statistica Neerlandica"},{"issue":"2","key":"384220_CR27","first-page":"229","volume":"83","author":"R. Schultz","year":"1998","unstructured":"Schultz, R., L. Stougie, and M.H. van der Vlerk (1998), Solving Stochastic Programs with Integer Recourse by Enumeration: A Framework using Grobner Basis Reductions. Mathematical Programming\n83(2), 229\u2013252.","journal-title":"Mathematical Programming"},{"issue":"3","key":"384220_CR28","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H.D. Sherali","year":"1990","unstructured":"Sherali, H.D. and W.P. Adams (1990), A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems. SIAM Journal on Discrete Mathematics\n3(3), 411\u2013430.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"384220_CR29","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"H.D. Sherali","year":"1994","unstructured":"Sherali, H.D. and W.P. Adams (1994), A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-Integer Zero-One Programming Problems. Discrete Applied Mathematics\n52(1), 83\u2013106.","journal-title":"Discrete Applied Mathematics"},{"key":"384220_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4388-3","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"H.D. Sherali","year":"1999","unstructured":"Sherali, H.D. and W.P. Adams (1999), A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Boston, MA: Kluwer Academic Publishing."},{"key":"384220_CR31","volume-title":"Partial Convexification Cuts","author":"H.D. Sherali","year":"2000","unstructured":"Sherali, H.D., Y. Lee, and Y. Kim (2000), Partial Convexification Cuts. Manuscript, Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA 24061. Also presented at the 17th International Symposium on Mathematical Programming, Atlanta, GA, August 7\u201311, 2000."},{"issue":"4","key":"384220_CR32","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"R.M. Van Slyke","year":"1969","unstructured":"Van Slyke, R.M. and R. Wets (1969), L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming. SIAM Journal of Applied Mathematics\n17(4), 638\u2013663.","journal-title":"SIAM Journal of Applied Mathematics"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013827731218.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013827731218\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013827731218.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:39:01Z","timestamp":1751366341000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013827731218"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":32,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["384220"],"URL":"https:\/\/doi.org\/10.1023\/a:1013827731218","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}