{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T05:33:14Z","timestamp":1768109594299,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,7,14]],"date-time":"2005-07-14T00:00:00Z","timestamp":1121299200000},"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":[[2006,4]]},"DOI":"10.1007\/s10107-005-0592-5","type":"journal-article","created":{"date-parts":[[2005,7,14]],"date-time":"2005-07-14T16:41:47Z","timestamp":1121359307000},"page":"203-223","source":"Crossref","is-referenced-by-count":129,"title":["Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming"],"prefix":"10.1007","volume":"106","author":[{"given":"Suvrajeet","family":"Sen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,14]]},"reference":[{"key":"592_CR1","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10107-003-0475-6","volume":"100","author":"Ahmed","year":"2004","unstructured":"Ahmed, S., Tawarmalani, M., Sahinidis, N.V.: A finite branch and bound algorithm for two-stage stochastic integer programs. Math. Prog. 100, 355\u2013377 (2004)","journal-title":"Math. Prog."},{"key":"592_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. Annals of Discrete Mathematics 5, 3\u201351 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"592_CR3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Prog. 58, 295\u2013324 (1993)","journal-title":"Math. Prog."},{"key":"592_CR4","first-page":"127","volume":"71","author":"Blair","year":"1995","unstructured":"Blair, C.: A closed-form representation of mixed-integer program value functions. Math. Prog. 71, 127\u2013136 (1995)","journal-title":"Math. Prog."},{"key":"592_CR5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF01583794","volume":"23","author":"Blair","year":"1982","unstructured":"Blair, C., Jeroslow, R.: The value function of an integer program. Math. Prog. 23, 237\u2013273 (1982)","journal-title":"Math. Prog."},{"key":"592_CR6","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, Berlin, Germany, 1997"},{"key":"592_CR7","unstructured":"Caroe, C.C.: Decomposition in Stochastic Integer Programming. Ph.D. thesis, Institute of Mathematical Sciences, Dept. of Operations Research, University of Copenhagen, Denmark, 1998"},{"key":"592_CR8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0167-6377(98)00050-9","volume":"24","author":"Caroe","year":"1999","unstructured":"Caroe, C.C., Schultz, R.: Dual decomposition in stochastic integer programming. Operations Research Letters 24, 37\u201345 (1999)","journal-title":"Operations Research Letters"},{"key":"592_CR9","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/0318018","volume":"18","author":"Jeroslow","year":"1980","unstructured":"Jeroslow, R.: A cutting plane game for facial disjunctive programs. SIAM Journal on Control and Optimization 18, 264\u2013281 (1980)","journal-title":"SIAM Journal on Control and Optimization"},{"key":"592_CR10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1023\/A:1018930113099","volume":"85","author":"Haneveld","year":"1999","unstructured":"Klein Haneveld, W.K., van der Vlerk, M.H.: Stochastic integer programming: general models and algorithms. Annals of Operations Research 85, 39\u201357 (1999)","journal-title":"Annals of Operations Research"},{"key":"592_CR11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90002-X","volume":"13","author":"Laporte","year":"1993","unstructured":"Laporte, G., Louveaux, F.V.: The integer L-shaped methods for stochastic integer programs with complete recourse. Operations Research Letters 13, 133\u2013142 (1993)","journal-title":"Operations Research Letters"},{"key":"592_CR12","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set functions and 0-1 optimization. SIAM J. on Optimization 1, 166\u2013190 (1991)","journal-title":"SIAM J. on Optimization"},{"key":"592_CR13","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1287\/mnsc.1030.0164","volume":"50","author":"Lulli","year":"2004","unstructured":"Lulli, G., Sen, S.: A branch and price algorithm for multi-stage stochastic integer programs with applications to stochastic lot sizing problems. Management Science 50, 786\u2013796 (2004)","journal-title":"Management Science"},{"key":"592_CR14","unstructured":"Ntaimo, L., Sen, S.: The million variable \u201cmarch\u201d for stochastic combinatorial optimization. To appear in Journal of Global Optimization 2003"},{"key":"592_CR15","first-page":"333","volume":"79","author":"Ruszczy\u0144ski","year":"1997","unstructured":"Ruszczy\u0144ski, A.: Decomposition methods in stochastic programming. Mathematical Programming B (Liebling and de Werra (eds.)), 79, 333\u2013353 (1997)","journal-title":"Mathematical Programming B (Liebling and de Werra (eds.)),"},{"key":"592_CR16","first-page":"73","volume":"70","author":"Schultz","year":"1995","unstructured":"Schultz, R.: On the structure and stability in stochastic programs with random technology matrix and complete integer recourse. Mathematical Programming 70, 73\u201389 (1995)","journal-title":"Mathematical Programming"},{"key":"592_CR17","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10107-003-0445-z","volume":"97","author":"Schultz","year":"2003","unstructured":"Schultz, R.: Stochastic programming with integer variables. Mathematical Programming Series B 97, 285\u2013309 (2003)","journal-title":"Mathematical Programming Series B"},{"key":"592_CR18","unstructured":"Sen, S.: Decomposition algorithms for stochastic mixed-integer programming models. To appear in Handbook of Discrete Optimization. (K. Aardal, G. Nemhauser, R. Weismental, eds.), Elsevier Publishers, 2003"},{"key":"592_CR19","doi-asserted-by":"crossref","unstructured":"Sen, S., Higle, J.L.: The C 3 theorem and a D 2 algorithm for large scale stochastic optimization: set convexification. To appear in Mathematical Programming, 2004","DOI":"10.1007\/s10107-004-0566-z"},{"key":"592_CR20","doi-asserted-by":"crossref","unstructured":"Sen, S., Higle, J.L., Ntaimo, L.: A summary and illustration of disjunctive decomposition with set convexification. Stochastic Integer Programming and Network Interdiction Models. (D.L. Woodruff ed.), Kluwer Academic Press, Dordrecht, The Netherlands, 2002, pp. 105\u2013125","DOI":"10.1007\/0-306-48109-X_6"},{"key":"592_CR21","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0166-218X(85)90078-2","volume":"11","author":"Sen","year":"1985","unstructured":"Sen, S., Sherali, H.D.: A branch and bound algorithm for extreme point mathematical programming. Discrete Applied Mathematics 11, 265\u2013280 (1985)","journal-title":"Discrete Applied Mathematics"},{"key":"592_CR22","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics 3, 411\u2013430 (1990)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"592_CR23","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"Sherali","year":"1994","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations and convex hull characterizations for mixed integer zero-one programming problems. Discrete Applied Mathematics 52, 83\u2013106 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"592_CR24","doi-asserted-by":"crossref","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Lizearization Technique for Solving Discrete and Continuous Nonconvex problems. Kluwer Academic Publishers, Boston, MA, 1999","DOI":"10.1007\/978-1-4757-4388-3"},{"key":"592_CR25","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1023\/A:1013827731218","volume":"22","author":"Sherali","year":"2002","unstructured":"Sherali, H.D., Fraticelli, B.M.P: A modification of Benders' decomposition algorithm for discrete subproblems: an approach for stochastic programs with integer recourse. Journal of Global Optimization 22, 319\u2013342 (2002)","journal-title":"Journal of Global Optimization"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0592-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-005-0592-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0592-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T07:28:24Z","timestamp":1586330904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-005-0592-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7,14]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["592"],"URL":"https:\/\/doi.org\/10.1007\/s10107-005-0592-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7,14]]}}}