{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T21:01:10Z","timestamp":1780606870159,"version":"3.54.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T00:00:00Z","timestamp":1114646400000},"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":[[2005,9]]},"DOI":"10.1007\/s10107-004-0566-z","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T18:10:42Z","timestamp":1114711842000},"page":"1-20","source":"Crossref","is-referenced-by-count":117,"title":["The C3 Theorem and a D2 Algorithm for Large Scale Stochastic Mixed-Integer Programming: Set Convexification"],"prefix":"10.1007","volume":"104","author":[{"given":"Suvrajeet","family":"Sen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Julia L.","family":"Higle","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,4,28]]},"reference":[{"key":"566_CR1","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. Ann. Disc. Math. 5, 3\u201331 (1979)","journal-title":"Ann. Disc. Math."},{"key":"566_CR2","first-page":"19","volume":"79","author":"Balas","year":"1997","unstructured":"Balas, E.: A modified lift-and-project procedure. Math. Prog. Series B 79, 19\u201331 (1997)","journal-title":"Math. Prog. Series B"},{"key":"566_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":"566_CR4","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"Balas","year":"1996","unstructured":"Balas, E., Ceria, S, Cornu\u00e9jols, G.: Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Management Sci. 42, 1229\u20131246 (1996)","journal-title":"Management Sci."},{"key":"566_CR5","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variable programming problems. Numerische Math. 4, 238\u2013252 (1962)","journal-title":"Numerische Math."},{"key":"566_CR6","doi-asserted-by":"crossref","unstructured":"Blair: Facial disjunctive programs and sequence of cutting planes. Disc. Appl. Math. 2, pp. 173\u2013179 (1980)","DOI":"10.1016\/0166-218X(80)90037-2"},{"key":"566_CR7","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":"566_CR8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF00933212","volume":"25","author":"Blair","year":"1978","unstructured":"Blair, C., Jeroslow, R.: A converse for disjunctive constraints. J. Optim. Theor. Appl. 25, 195\u2013206 (1978)","journal-title":"J. Optim. Theor. Appl."},{"key":"566_CR9","first-page":"237","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":"Prog."},{"key":"566_CR10","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer (1997)"},{"key":"566_CR11","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":"566_CR12","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/S0377-2217(96)00399-2","volume":"101","author":"Caroe","year":"1997","unstructured":"Caroe, C.C., Tind, J.: A cutting plane approach to mixed 0-1 stochastic integer programs. European J. Oper. Res. 101, 306\u2013316 (1997)","journal-title":"European J. Oper. Res."},{"key":"566_CR13","first-page":"139","volume":"83","author":"Caroe","year":"3","unstructured":"Caroe, C.C., Tind, J.: L-shaped decomposition of two-stage stochastic programs with integer recourse. Math. Prog. 83 (3), 139\u2013152 (1998)","journal-title":"Math. Prog."},{"key":"566_CR14","doi-asserted-by":"crossref","unstructured":"Conti, P., Traverso, C.: Buchberger algorithm and integer programming. Proceedings of AAECC-9 New Orleans, Springer Verlag LNCS 539, pp. 130\u2013139 (1991)","DOI":"10.1007\/3-540-54522-0_102"},{"key":"566_CR15","doi-asserted-by":"crossref","unstructured":"Glover, F., Laguna, M.: Tabu Search, Kluwer Academic Publishers (1997)","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"566_CR16","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1287\/moor.17.1.112","volume":"17","author":"Higle","year":"1992","unstructured":"Higle, J.L., Sen, S.: On the convergence of algorithms with implications for stochastic and nondifferentiable optimization. Math. Oper. Res. 17, 112\u2013131 (1992)","journal-title":"Math. Oper. Res."},{"key":"566_CR17","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF02192118","volume":"84","author":"Higle","year":"1995","unstructured":"Higle, J.L., Sen, S.: Epigraphical Nesting: a unifying theory for the convergence of algorithms. J. Optim. Theor. Appl. 84, 339-360 (1995)","journal-title":"J. Optim. Theor. Appl."},{"key":"566_CR18","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 J. Cont. Optim. 18, 264\u2013281 (1980)","journal-title":"SIAM J. Cont. Optim."},{"key":"566_CR19","first-page":"703","volume":"8","author":"Kelley","year":"1960","unstructured":"Kelley, J.E.: The cutting plane method for convex programs, J. SIAM 8, 703\u2013712 (1960)","journal-title":"SIAM"},{"key":"566_CR20","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02031708","volume":"56","author":"Haneveld","year":"1995","unstructured":"Klein Haneveld, W.K., Stougie, L., van der Vlerk, M.H.: On the convex hull of the simple integer recourse objective function. Ann. Oper. Res. 56, 209\u2013224 (1995)","journal-title":"Ann. Oper. Res."},{"key":"566_CR21","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02187641","volume":"64","author":"Haneveld","year":"1996","unstructured":"Klein Haneveld, W.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, 67\u201381 (1996)","journal-title":"Ann. Oper. Res."},{"key":"566_CR22","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. Ann. Oper. Res. 85, 39\u201357 (1999)","journal-title":"Ann. Oper. Res."},{"key":"566_CR23","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. Oper. Res. Lett. 13, 133\u2013142 (1993)","journal-title":"Oper. Res. Lett."},{"key":"566_CR24","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF00247208","volume":"2","author":"Lokketangen","year":"1996","unstructured":"Lokketangen, A., Woodruff, D.L.: Progressive hedging and tabu search applied to mixed integer (0,1) multi-stage stochastic programming. J. Heuristics 2, 111\u2013128 (1996)","journal-title":"J. Heuristics"},{"key":"566_CR25","doi-asserted-by":"crossref","unstructured":"Martin, R.K.: Large Scale Linear and Integer Optimization. Kluwer Academic Publishers (1999)","DOI":"10.1007\/978-1-4615-4975-8"},{"key":"566_CR26","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1287\/mnsc.24.3.312","volume":"24","author":"McDaniel","year":"1977","unstructured":"McDaniel, D., Devine, M.: A modified Benders\u2019 partitioning algorithm for mixed integer programming. Management Science 24, 312\u2013319 (1977)","journal-title":"Management Science"},{"key":"566_CR27","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/opre.46.3.381","volume":"46","author":"Norkin","year":"3","unstructured":"Norkin, V.I., Ermoliev, Y.M., Ruszczynski, A.: On optimal allocation of indivisibles under uncertainty. Oper. Res. 46 (3), 381\u2013395 (1998)","journal-title":"Oper. Res."},{"key":"566_CR28","doi-asserted-by":"crossref","unstructured":"Nowak, M., R\u00f6misch, W.: Stochastic Lagrangian relaxation applied to power scheduling in a hydro-thermal system under uncertainty. to appear in, Ann. Oper. Res. (2000)","DOI":"10.1023\/A:1019248506301"},{"key":"566_CR29","doi-asserted-by":"crossref","unstructured":"Richter, Jr., C.W., Shebl\u00e9, G.B.: Building and evaluating Genco bidding strategies and unit commitment schedules with Genetic Algorithms. In: Next Generation of Electric Power Unit Commitment Models, B.F. Hobbs et al, (eds.), pp. 185-209 (2001)","DOI":"10.1007\/0-306-47663-0_11"},{"key":"566_CR30","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/moor.16.1.119","volume":"16","author":"Rockafellar","year":"1991","unstructured":"Rockafellar, R.T., Wets R.J-B.: Scenario and policy aggregation in optimization under uncertainty. Math. Oper. Res. 16, 119\u2013147 (1991)","journal-title":"Math. Oper. Res."},{"key":"566_CR31","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T., Wets R.J-B.: Variational Analysis, Springer (1997)","DOI":"10.1007\/978-3-642-02431-3"},{"key":"566_CR32","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1287\/moor.18.3.578","volume":"18","author":"Schultz","year":"1993","unstructured":"Schultz, R.: Continuity properties of expectation functions in stochastic integer programming. Math. Oper. Res. 18, 578\u2013589 (1993)","journal-title":"Math. Oper. Res."},{"key":"566_CR33","first-page":"71","volume":"83","author":"Schultz","year":"2","unstructured":"Schultz, R., Stougie, L., van der Vlerk, M.H.: Solving stochastic programs with integer recourse by enumeration: a framework using Grobner basis reduction. Math. Prog. 83 (2), 71\u201394 (1998)","journal-title":"Math. Prog."},{"key":"566_CR34","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0167-6377(92)90037-4","volume":"11","author":"Sen","year":"1992","unstructured":"Sen, S.: Relaxations for probabilistically constrained programs with discrete random variables. Oper. Res. Lett. 11, 81\u201386 (1992)","journal-title":"Oper. Res. Lett."},{"key":"566_CR35","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/BF02591860","volume":"31","author":"Sen","year":"1985","unstructured":"Sen, S., Sherali, H.D.: On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs. Math. Prog. 31, 42\u201356 (1985)","journal-title":"Math. Prog."},{"key":"566_CR36","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. Disc. Appl. Math. 11, 265\u2013280 (1985)","journal-title":"Disc. Appl. Math."},{"key":"566_CR37","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/BF01582164","volume":"34","author":"Sen","year":"1986","unstructured":"Sen, S., Sherali, H.D.: Facet inequalities from simple disjunctions in cutting plane theory. Math. Prog. 34, 72\u201383 (1986)","journal-title":"Math. Prog."},{"key":"566_CR38","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02591693","volume":"37","author":"Sen","year":"1987","unstructured":"Sen, S., Sherali, H.D.: Nondifferentiable reverse convex programs and facetial cuts via a disjunctive characterization. Math. Prog. 37, 169\u2013183 (1987)","journal-title":"Math. Prog."},{"key":"566_CR39","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"Sherali","year":"1990","unstructured":"Sherali, H.D., Adams: A hierarchy of relaxations between the continuous and convex hull representations for 0-1 programming problems. SIAM J. Disc. Math. 3, 411\u2013430 (1990)","journal-title":"SIAM J. Disc. Math."},{"key":"566_CR40","unstructured":"Sherali, H.D., Fraticelli, B.M.P: A modified Benders\u2019 partitioning approach for problems having discrete subproblems with application to stochastic programs with integer recourse. Working Paper, Virginia Polytechnic Institute and State University, Blacksburg, VA (2000)"},{"key":"566_CR41","doi-asserted-by":"crossref","unstructured":"Sherali, H.D., Shetty, C.M.: Optimization with Disjunctive Constraints, Lecture Notes in Economics and Math. Systems, Vol. 181, Springer-Verlag, Berlin (1980)","DOI":"10.1007\/978-3-642-48794-1"},{"key":"566_CR42","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/59.535691","volume":"11","author":"Takriti","year":"1996","unstructured":"Takriti, S., Birge, J.R., Long, E.: A stochastic model for the unit commitment problem. IEEE Trans. Power Sys. 11, 1497\u20131508 (1996)","journal-title":"IEEE Trans. Power Sys."},{"key":"566_CR43","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1287\/moor.20.4.864","volume":"20","author":"Thomas","year":"1995","unstructured":"Thomas, R.: A geometric Buchberger algorithm for integer programming. Math. Oper. Res. 20, 864\u2013884, (1995)","journal-title":"Math. Oper. Res."},{"key":"566_CR44","unstructured":"van der Vlerk, M.H.: Stochastic Programming with Integer Recourse, Thesis Rijksuniversiteit Groningen, Labyrinth Publication, The Netherlands (1995)"},{"key":"566_CR45","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"Slyke","year":"1969","unstructured":"van Slyke, R., Wets, R.J-B.: L-Shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. 17, 638\u2013663 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"566_CR46","doi-asserted-by":"crossref","unstructured":"Wallace, S.W.: A two-stage stochastic facility location problem with time-dependent supply. In: Numerical Techniques for Stochastic Optimization, (Yu. Ermoliev and R. J-B. Wets (eds.)) pp. 489\u2013513 (1988)","DOI":"10.1007\/978-3-642-61370-8_28"},{"key":"566_CR47","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/1016053","volume":"16","author":"Wets","year":"1974","unstructured":"Wets, R.J-B.: Stochastic Programs with fixed recourse: the equivalent deterministic problem. SIAM Rev. 16, 309\u2013339 (1974)","journal-title":"SIAM Rev."},{"key":"566_CR48","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01581648","volume":"19","author":"Wollmer","year":"1980","unstructured":"Wollmer, R.M.: Two stage linear programming under uncertainty with 0-1 first stage variables. Math. Prog. 19, 279\u2013288 (1980)","journal-title":"Math. Prog."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0566-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-004-0566-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0566-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T04:15:16Z","timestamp":1586232916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-004-0566-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4,28]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["566"],"URL":"https:\/\/doi.org\/10.1007\/s10107-004-0566-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,4,28]]}}}