{"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":1780606870054,"version":"3.54.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,4,23]],"date-time":"2016-04-23T00:00:00Z","timestamp":1461369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2016,4,23]],"date-time":"2016-04-23T00:00:00Z","timestamp":1461369600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA-9550-13-1-0015"],"award-info":[{"award-number":["FA-9550-13-1-0015"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000084","name":"Directorate for Engineering","doi-asserted-by":"publisher","award":["ECCS-1548847"],"award-info":[{"award-number":["ECCS-1548847"]}],"id":[{"id":"10.13039\/100000084","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000084","name":"Directorate for Engineering","doi-asserted-by":"publisher","award":["CMMI-1100383"],"award-info":[{"award-number":["CMMI-1100383"]}],"id":[{"id":"10.13039\/100000084","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10107-016-1006-6","type":"journal-article","created":{"date-parts":[[2016,4,23]],"date-time":"2016-04-23T04:22:43Z","timestamp":1461385363000},"page":"193-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["The Ancestral Benders\u2019 cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming"],"prefix":"10.1007","volume":"161","author":[{"given":"Yunwei","family":"Qi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Suvrajeet","family":"Sen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,23]]},"reference":[{"issue":"2","key":"1006_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.V.: A finite branch-and-bound algorithm for two-stage stochastic integer programs. Math. Program. 100(2), 355\u2013377 (2004)","journal-title":"Math. Program."},{"key":"1006_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. Ann. Discret. Math. 5, 3\u201351 (1979)","journal-title":"Ann. Discret. Math."},{"key":"1006_CR3","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, 295\u2013324 (1993)","journal-title":"Math. Program."},{"key":"1006_CR4","doi-asserted-by":"publisher","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, 451\u2013464 (1998)","journal-title":"Math. Program."},{"key":"1006_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0167-6377(98)00050-9","volume":"24","author":"CC Car\u00f8e","year":"1997","unstructured":"Car\u00f8e, C.C., Schultz, R.: Dual decomposition in stochastic integer programming. Oper. Res. Lett. 24, 37\u201345 (1997)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1006_CR6","doi-asserted-by":"publisher","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."},{"issue":"1","key":"1006_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.orl.2011.10.009","volume":"40","author":"B Chen","year":"2012","unstructured":"Chen, B., K\u00fc\u00e7\u00fckyavuz, S., Sen, S.: A computational study of the cutting plane tree algorithm for general mixed-integer linear programs. Oper. Res. Lett. 40(1), 15\u201319 (2012)","journal-title":"Oper. Res. Lett."},{"issue":"1\u20132","key":"1006_CR8","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10107-011-0476-9","volume":"135","author":"A Del Pia","year":"2012","unstructured":"Del Pia, A., Weismantel, R.: On convergence in mixed integer programming. Math. Program. 135(1\u20132), 397\u2013412 (2012)","journal-title":"Math. Program."},{"key":"1006_CR9","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10479-006-0138-0","volume":"152","author":"L Escudero","year":"2007","unstructured":"Escudero, L., Garn, A., Merino, M., P\u00e9rez, G.: A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and benders decomposition schemes. Ann. Oper. Res. 152, 395\u2013420 (2007). doi:10.1007\/s10479-006-0138-0","journal-title":"Ann. Oper. Res."},{"issue":"1\u20132","key":"1006_CR10","first-page":"1","volume":"144","author":"D Gade","year":"2012","unstructured":"Gade, D., K\u00fc\u00e7\u00fckyavuz, S., Sen, S.: Decomposition algorithms with parametric gomory cuts for two-stage stochastic integer programs. Math. Program. 144(1\u20132), 1\u201326 (2012)","journal-title":"Math. Program."},{"key":"1006_CR11","unstructured":"J\u00f6rg, M.: k-Disjunctive cuts and a finite cutting plane algorithm for general mixed integer linear programs. Ph.D. thesis, Technische Universitat Munchen (2008)"},{"issue":"24","key":"1006_CR12","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. Math. Program. 108(24), 275\u2013296 (2006)","journal-title":"Math. Program."},{"key":"1006_CR13","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0927-0507(03)10004-7","volume":"10","author":"F Louveaux","year":"2003","unstructured":"Louveaux, F., Schultz, R.: Stochastic integer programming. Handb. Oper. Res. Manag. Sci. 10, 213\u2013266 (2003)","journal-title":"Handb. Oper. Res. Manag. Sci."},{"key":"1006_CR14","doi-asserted-by":"crossref","unstructured":"Lulli, G., Sen, S.: A branch-and-price algorithm for multistage stochastic integer programming with application to stochastic batch-sizing problems. Manag. Sci. 50(6), 786\u2013796, arXiv preprint arXiv:0707.3945 (2004)","DOI":"10.1287\/mnsc.1030.0164"},{"issue":"1","key":"1006_CR15","doi-asserted-by":"publisher","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":"1006_CR16","doi-asserted-by":"publisher","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 \u201cmarch\u201d for stochastic combinatorial optimization. J. Global Optim. 32(3), 385\u2013400 (2005)","journal-title":"J. Global Optim."},{"issue":"3","key":"1006_CR17","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/PL00011407","volume":"89","author":"JH Owen","year":"2001","unstructured":"Owen, J.H., Mehrotra, S.: A disjunctive cutting plane procedure for general mixed-integer linear programs. Math. Program. 89(3), 437\u2013448 (2001)","journal-title":"Math. Program."},{"issue":"5","key":"1006_CR18","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1287\/opre.50.5.810.370","volume":"50","author":"JH Owen","year":"2002","unstructured":"Owen, J.H., Mehrotra, S.: On the value of binary expansions for general mixed-integer linear programs. Oper. Res. 50(5), 810\u2013819 (2002)","journal-title":"Oper. Res."},{"issue":"1\u20133","key":"1006_CR19","first-page":"229","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."},{"key":"1006_CR20","volume-title":"Stochastic Mixed-Integer Programming Algorithms: Beyond Benders\u2019 Decomposition","author":"S Sen","year":"2010","unstructured":"Sen, S.: Stochastic Mixed-Integer Programming Algorithms: Beyond Benders\u2019 Decomposition. Wiley, London (2010)"},{"issue":"1","key":"1006_CR21","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."},{"key":"1006_CR22","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/0-306-48109-X_6","volume-title":"Network Interdiction and Stochastic Integer Programming","author":"S Sen","year":"2003","unstructured":"Sen, S., Higle, J.L., 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, New York (2003)"},{"issue":"2","key":"1006_CR23","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."},{"issue":"2\u20133","key":"1006_CR24","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10107-006-0724-6","volume":"108","author":"HD Sherali","year":"2006","unstructured":"Sherali, H.D., Zhu, X.: 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."},{"issue":"2","key":"1006_CR25","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.1120.1156","volume":"61","author":"AC Trapp","year":"2013","unstructured":"Trapp, A.C., Prokopyev, O.A., Schaefer, A.J.: On a level-set characterization of the integer programming value function and its application to stochastic programming. Oper. Res. 61(2), 498\u2013511 (2013)","journal-title":"Oper. Res."},{"issue":"3","key":"1006_CR26","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(3), 279\u2013288 (1980)","journal-title":"Math. Program."},{"issue":"3","key":"1006_CR27","doi-asserted-by":"publisher","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":"4","key":"1006_CR28","doi-asserted-by":"publisher","first-page":"1933","DOI":"10.1137\/13092678X","volume":"24","author":"M Zhang","year":"2014","unstructured":"Zhang, M., K\u00fc\u00e7\u00fckyavuz, S.: Finitely convergent decomposition algorithms for two-stage stochastic pure integer programs. SIAM J. Optim. 24(4), 1933\u20131951 (2014)","journal-title":"SIAM J. Optim."}],"updated-by":[{"DOI":"10.1007\/s10107-023-02039-y","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T00:00:00Z","timestamp":1702425600000}}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1006-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-016-1006-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1006-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1006-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T12:07:40Z","timestamp":1702469260000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-016-1006-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,23]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["1006"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1006-6","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s10107-023-02039-y","asserted-by":"object"}]},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,23]]},"assertion":[{"value":"3 September 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2023","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10107-023-02039-y","URL":"https:\/\/doi.org\/10.1007\/s10107-023-02039-y","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}