{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T00:08:39Z","timestamp":1770682119555,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T00:00:00Z","timestamp":1660953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T00:00:00Z","timestamp":1660953600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000084","name":"Directorate for Engineering","doi-asserted-by":"publisher","award":["1751747"],"award-info":[{"award-number":["1751747"]}],"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":[[2022,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we study multistage stochastic mixed-integer nonlinear programs (MS-MINLP). This general class of problems encompasses, as important special cases, multistage stochastic convex optimization with <jats:italic>non-Lipschitzian<\/jats:italic> value functions and multistage stochastic mixed-integer linear optimization. We develop stochastic dual dynamic programming (SDDP) type algorithms with nested decomposition, deterministic sampling, and stochastic sampling. The key ingredient is a new type of cuts based on generalized conjugacy. Several interesting classes of MS-MINLP are identified, where the new algorithms are guaranteed to obtain the global optimum without the assumption of complete recourse. This significantly generalizes the classic SDDP algorithms. We also characterize the iteration complexity of the proposed algorithms. In particular, for a <jats:inline-formula><jats:alternatives><jats:tex-math>$$(T+1)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>T<\/mml:mi>\n                    <mml:mo>+<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-stage stochastic MINLP satisfying <jats:italic>L<\/jats:italic>-exact Lipschitz regularization with <jats:italic>d<\/jats:italic>-dimensional state spaces, to obtain an <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\varepsilon $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03b5<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-optimal root node solution, we prove that the number of iterations of the proposed deterministic sampling algorithm is upper bounded by <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathcal {O}}((\\frac{2LT}{\\varepsilon })^d)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>O<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:msup>\n                      <mml:mrow>\n                        <mml:mo>(<\/mml:mo>\n                        <mml:mfrac>\n                          <mml:mrow>\n                            <mml:mn>2<\/mml:mn>\n                            <mml:mi>L<\/mml:mi>\n                            <mml:mi>T<\/mml:mi>\n                          <\/mml:mrow>\n                          <mml:mi>\u03b5<\/mml:mi>\n                        <\/mml:mfrac>\n                        <mml:mo>)<\/mml:mo>\n                      <\/mml:mrow>\n                      <mml:mi>d<\/mml:mi>\n                    <\/mml:msup>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, and is lower bounded by <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathcal {O}}((\\frac{LT}{4\\varepsilon })^d)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>O<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:msup>\n                      <mml:mrow>\n                        <mml:mo>(<\/mml:mo>\n                        <mml:mfrac>\n                          <mml:mrow>\n                            <mml:mi>LT<\/mml:mi>\n                          <\/mml:mrow>\n                          <mml:mrow>\n                            <mml:mn>4<\/mml:mn>\n                            <mml:mi>\u03b5<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:mfrac>\n                        <mml:mo>)<\/mml:mo>\n                      <\/mml:mrow>\n                      <mml:mi>d<\/mml:mi>\n                    <\/mml:msup>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> for the general case or by <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathcal {O}}((\\frac{LT}{8\\varepsilon })^{d\/2-1})$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>O<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:msup>\n                      <mml:mrow>\n                        <mml:mo>(<\/mml:mo>\n                        <mml:mfrac>\n                          <mml:mrow>\n                            <mml:mi>LT<\/mml:mi>\n                          <\/mml:mrow>\n                          <mml:mrow>\n                            <mml:mn>8<\/mml:mn>\n                            <mml:mi>\u03b5<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:mfrac>\n                        <mml:mo>)<\/mml:mo>\n                      <\/mml:mrow>\n                      <mml:mrow>\n                        <mml:mi>d<\/mml:mi>\n                        <mml:mo>\/<\/mml:mo>\n                        <mml:mn>2<\/mml:mn>\n                        <mml:mo>-<\/mml:mo>\n                        <mml:mn>1<\/mml:mn>\n                      <\/mml:mrow>\n                    <\/mml:msup>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> for the convex case. This shows that the obtained complexity bounds are rather sharp. It also reveals that the iteration complexity depends <jats:italic>polynomially<\/jats:italic> on the number of stages. We further show that the iteration complexity depends <jats:italic>linearly<\/jats:italic> on <jats:italic>T<\/jats:italic>, if all the state spaces are finite sets, or if we seek a <jats:inline-formula><jats:alternatives><jats:tex-math>$$(T\\varepsilon )$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>T<\/mml:mi>\n                    <mml:mi>\u03b5<\/mml:mi>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-optimal solution when the state spaces are infinite sets, i.e. allowing the optimality gap to scale with <jats:italic>T<\/jats:italic>. To the best of our knowledge, this is the first work that reports global optimization algorithms as well as iteration complexity results for solving such a large class of multistage stochastic programs. The iteration complexity study resolves a conjecture by the late Prof.\u00a0Shabbir Ahmed in the general setting of multistage stochastic mixed-integer optimization.  \n\n\n<\/jats:p>","DOI":"10.1007\/s10107-022-01875-8","type":"journal-article","created":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T14:02:32Z","timestamp":1661004152000},"page":"935-985","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Stochastic dual dynamic programming for multistage stochastic mixed-integer nonlinear optimization"],"prefix":"10.1007","volume":"196","author":[{"given":"Shixuan","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3917-9418","authenticated-orcid":false,"given":"Xu Andy","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,20]]},"reference":[{"key":"1875_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, S., Cabral, F.G., da\u00a0Costa, B.F.P.: Stochastic Lipschitz dynamic programming Math. Program. 191, 755\u2013793 (2022)","DOI":"10.1007\/s10107-020-01569-z"},{"key":"1875_CR2","doi-asserted-by":"crossref","unstructured":"Ahmed, S., King, A.J., Parija, G.: A Multi-stage Stochastic Integer Programming Approach for Capacity Expansion under Uncertainty. Journal of Global Optimization 26, 3\u201324 (2003)","DOI":"10.1023\/A:1023062915106"},{"key":"1875_CR3","doi-asserted-by":"publisher","unstructured":"Baringo, L., Conejo, A.J.: Risk-Constrained Multi-Stage Wind Power Investment. IEEE Transactions on Power Systems 28(1), 401\u2013411 (2013) https:\/\/doi.org\/10.1109\/TPWRS.2012.2205411. http:\/\/ieeexplore.ieee.org\/document\/6247489\/","DOI":"10.1109\/TPWRS.2012.2205411"},{"key":"1875_CR4","unstructured":"Basciftci, B., Ahmed, S., Gebraeel, N.: Adaptive Two-stage Stochastic Programming with an Application to Capacity Expansion Planning. arXiv:1906.03513 [math] (2019)"},{"key":"1875_CR5","unstructured":"Baucke, R., Downward, A., Zakeri, G.: A deterministic algorithm for solving multistage stochastic programming problems. Optim. Online p.\u00a025 (2017)"},{"key":"1875_CR6","doi-asserted-by":"crossref","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4, 238\u2013252 (1962)","DOI":"10.1007\/BF01386316"},{"issue":"5","key":"1875_CR7","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1287\/opre.33.5.989","volume":"33","author":"JR Birge","year":"1985","unstructured":"Birge, J.R.: Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs. Oper. Res. 33(5), 989\u20131007 (1985). https:\/\/doi.org\/10.1287\/opre.33.5.989","journal-title":"Oper. Res."},{"issue":"2","key":"1875_CR8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1287\/mnsc.19.2.139","volume":"19","author":"SP Bradley","year":"1972","unstructured":"Bradley, S.P., Crane, D.B.: A Dynamic Model for Bond Portfolio Management. Manage. Sci. 19(2), 139\u2013151 (1972). https:\/\/doi.org\/10.1287\/mnsc.19.2.139","journal-title":"Manage. Sci."},{"key":"1875_CR9","doi-asserted-by":"publisher","unstructured":"Chen, Z.L., Li, S., Tirupati, D.: A scenario-based stochastic programming approach for technology and capacity planning. Computers & Operations Research 29(7), 781\u2013806 (2002) https:\/\/doi.org\/10.1016\/S0305-0548(00)00076-9. http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000769","DOI":"10.1016\/S0305-0548(00)00076-9"},{"issue":"3","key":"1875_CR10","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1023\/A:1022641805263","volume":"102","author":"ZL Chen","year":"1999","unstructured":"Chen, Z.L., Powell, W.B.: Convergent Cutting-Plane and Partial-Sampling Algorithm for Multistage Stochastic Linear Programs with Recourse. J. Optim. Theory Appl. 102(3), 497\u2013524 (1999). https:\/\/doi.org\/10.1023\/A:1022641805263","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1875_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig, G.B., Wolfe, P.: Decomposition Principle for Linear Programs. Oper. Res. 8(1), 101\u2013111 (1960). https:\/\/doi.org\/10.1287\/opre.8.1.101","journal-title":"Oper. Res."},{"key":"1875_CR12","doi-asserted-by":"crossref","unstructured":"Escudero, L.F., Kamesam, P.V., King, A.J., Wets, R.J.B.: Production planning via scenario modelling. Annals of Operations Research 43, 309\u2013335 (1993)","DOI":"10.1007\/BF02025089"},{"issue":"1\u20132","key":"1875_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10107-016-1012-8","volume":"161","author":"MJ Feizollahi","year":"2017","unstructured":"Feizollahi, M.J., Ahmed, S., Sun, A.: Exact augmented lagrangian duality for mixed integer linear programming. Math. Program. 161(1\u20132), 365\u2013387 (2017)","journal-title":"Math. Program."},{"issue":"2","key":"1875_CR14","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1049\/iet-gtd.2009.0107","volume":"4","author":"B Flach","year":"2010","unstructured":"Flach, B., Barroso, L., Pereira, M.: Long-term optimal allocation of hydro generation for a price-maker company in a competitive market: latest developments and a stochastic dual dynamic programming approach. IET Generation, Transmission & Distribution 4(2), 299 (2010). https:\/\/doi.org\/10.1049\/iet-gtd.2009.0107","journal-title":"IET Generation, Transmission & Distribution"},{"issue":"1","key":"1875_CR15","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/moor.2014.0664","volume":"40","author":"P Girardeau","year":"2015","unstructured":"Girardeau, P., Leclere, V., Philpott, A.B.: On the Convergence of Decomposition Methods for Multistage Stochastic Convex Programs. Math. Oper. Res. 40(1), 130\u2013145 (2015). https:\/\/doi.org\/10.1287\/moor.2014.0664","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1875_CR16","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1287\/mnsc.20.3.282","volume":"20","author":"CR Glassey","year":"1973","unstructured":"Glassey, C.R.: Nested Decomposition and Multi-Stage Linear Programs. Manage. Sci. 20(3), 282\u2013292 (1973). https:\/\/doi.org\/10.1287\/mnsc.20.3.282","journal-title":"Manage. Sci."},{"issue":"4","key":"1875_CR17","doi-asserted-by":"publisher","first-page":"2468","DOI":"10.1137\/140983136","volume":"26","author":"V Guigues","year":"2016","unstructured":"Guigues, V.: Convergence analysis of sampling-based decomposition methods for risk-averse multistage stochastic convex programs. SIAM J. Optim. 26(4), 2468\u20132494 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1875_CR18","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ejor.2016.10.047","volume":"258","author":"V Guigues","year":"2017","unstructured":"Guigues, V.: Dual dynamic programing with cut selection: Convergence proof and numerical experiments. Eur. J. Oper. Res. 258(1), 47\u201357 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"1875_CR19","doi-asserted-by":"publisher","unstructured":"Hjelmeland, M.N., Zou, J., Helseth, A., Ahmed, S.: Nonconvex Medium-Term Hydropower Scheduling by Stochastic Dual Dynamic Integer Programming. IEEE Transactions on Sustainable Energy 10(1), 481\u2013490 (2019) https:\/\/doi.org\/10.1109\/TSTE.2018.2805164. http:\/\/ieeexplore.ieee.org\/document\/8289405\/","DOI":"10.1109\/TSTE.2018.2805164"},{"issue":"1","key":"1875_CR20","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF01580231","volume":"6","author":"JK Ho","year":"1974","unstructured":"Ho, J.K., Manne, A.S.: Nested decomposition for dynamic models. Math. Program. 6(1), 121\u2013140 (1974). https:\/\/doi.org\/10.1007\/BF01580231","journal-title":"Math. Program."},{"issue":"3","key":"1875_CR21","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1287\/opre.34.3.356","volume":"34","author":"MI Kusy","year":"1986","unstructured":"Kusy, M.I., Ziemba, W.T.: A Bank Asset and Liability Management Model. Oper. Res. 34(3), 356\u2013376 (1986). https:\/\/doi.org\/10.1287\/opre.34.3.356","journal-title":"Oper. Res."},{"key":"1875_CR22","unstructured":"Lan, G.: Complexity of stochastic dual dynamic programming. Mathematical Programming pp. 1\u201338 (2020)"},{"key":"1875_CR23","doi-asserted-by":"publisher","unstructured":"Lara, C.L., Mallapragada, D.S., Papageorgiou, D.J., Venkatesh, A., Grossmann, I.E.: Deterministic electric power infrastructure planning: Mixed-integer programming model and nested decomposition algorithm. European Journal of Operational Research 271(3), 1037\u20131054 (2018) https:\/\/doi.org\/10.1016\/j.ejor.2018.05.039. http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221718304466","DOI":"10.1016\/j.ejor.2018.05.039"},{"issue":"2","key":"1875_CR24","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10957-004-1842-z","volume":"125","author":"K Linowsky","year":"2005","unstructured":"Linowsky, K., Philpott, A.B.: On the Convergence of Sampling-Based Decomposition Algorithms for Multistage Stochastic Programs. J. Optim. Theory Appl. 125(2), 349\u2013366 (2005). https:\/\/doi.org\/10.1007\/s10957-004-1842-z","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"1875_CR25","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1287\/opre.28.4.889","volume":"28","author":"FV Louveaux","year":"1980","unstructured":"Louveaux, F.V.: A Solution Method for Multistage Stochastic Programs with Recourse with Application to an Energy Investment Problem. Oper. Res. 28(4), 889\u2013902 (1980). https:\/\/doi.org\/10.1287\/opre.28.4.889","journal-title":"Oper. Res."},{"issue":"11","key":"1875_CR26","doi-asserted-by":"publisher","first-page":"1642","DOI":"10.1287\/mnsc.38.11.1642","volume":"38","author":"JM Mulvey","year":"1992","unstructured":"Mulvey, J.M., Vladimirou, H.: Stochastic Network Programming for Financial Planning Problems. Manage. Sci. 38(11), 1642\u20131664 (1992). https:\/\/doi.org\/10.1287\/mnsc.38.11.1642","journal-title":"Manage. Sci."},{"key":"1875_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on Convex Optimization","author":"Y Nesterov","year":"2018","unstructured":"Nesterov, Y.: Lectures on Convex Optimization, vol. 137. Springer, Berlin (2018)"},{"issue":"6","key":"1875_CR28","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1029\/WR021i006p00779","volume":"21","author":"MVF Pereira","year":"1985","unstructured":"Pereira, M.V.F., Pinto, L.M.V.G.: Stochastic Optimization of a Multireservoir Hydroelectric System: A Decomposition Approach. Water Resour. Res. 21(6), 779\u2013792 (1985). https:\/\/doi.org\/10.1029\/WR021i006p00779","journal-title":"Water Resour. Res."},{"issue":"1\u20133","key":"1875_CR29","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF01582895","volume":"52","author":"MVF Pereira","year":"1991","unstructured":"Pereira, M.V.F., Pinto, L.M.V.G.: Multi-stage stochastic optimization applied to energy planning. Math. Program. 52(1\u20133), 359\u2013375 (1991). https:\/\/doi.org\/10.1007\/BF01582895","journal-title":"Math. Program."},{"key":"1875_CR30","doi-asserted-by":"publisher","unstructured":"Philpott, A., Guan, Z.: On the convergence of stochastic dual dynamic programming and related methods. Operations Research Letters 36(4), 450\u2013455 (2008) https:\/\/doi.org\/10.1016\/j.orl.2008.01.013. http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637708000308","DOI":"10.1016\/j.orl.2008.01.013"},{"key":"1875_CR31","doi-asserted-by":"crossref","unstructured":"Philpott, A., Wahid, F., Bonnans, F.: MIDAS: A Mixed Integer Dynamic Approximation Scheme. Mathematical Programming 181, 19\u201350 (2020)","DOI":"10.1007\/s10107-019-01368-1"},{"key":"1875_CR32","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis, vol. 317. Springer Science & Business Media, Berlin (2009)"},{"key":"1875_CR33","doi-asserted-by":"publisher","unstructured":"Shapiro, A.: Analysis of stochastic dual dynamic programming method. European J. Oper. Res. 209(1), 63\u201372 (2011) https:\/\/doi.org\/10.1016\/j.ejor.2010.08.007. http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221710005448","DOI":"10.1016\/j.ejor.2010.08.007"},{"key":"1875_CR34","doi-asserted-by":"publisher","unstructured":"Shapiro, A., Tekaya, W., da Costa, J.P., Soares, M.P.: Risk neutral and risk averse Stochastic Dual Dynamic Programming method. European J. Oper. Res. 224(2), 375\u2013391 (2013) https:\/\/doi.org\/10.1016\/j.ejor.2012.08.022. http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221712006455","DOI":"10.1016\/j.ejor.2012.08.022"},{"key":"1875_CR35","doi-asserted-by":"crossref","unstructured":"Slyke, R.M.V., Wets, R.: L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming. SIAM J. Appl. Math. 17(4), 638\u2013663 (1969). http:\/\/www.jstor.org\/stable\/2099310","DOI":"10.1137\/0117061"},{"issue":"2","key":"1875_CR36","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1287\/opre.48.2.268.12379","volume":"48","author":"S Takriti","year":"2000","unstructured":"Takriti, S., Krasenbrink, B., Wu, L.S.Y.: Incorporating Fuel Constraints and Electricity Spot Prices into the Stochastic Unit Commitment Problem. Oper. Res. 48(2), 268\u2013280 (2000). https:\/\/doi.org\/10.1287\/opre.48.2.268.12379","journal-title":"Oper. Res."},{"issue":"2","key":"1875_CR37","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/ijoc.2017.0782","volume":"30","author":"J Zou","year":"2018","unstructured":"Zou, J., Ahmed, S., Sun, X.A.: Partially Adaptive Stochastic Optimization for Electric Power Generation Expansion Planning. INFORMS J. Comput. 30(2), 388\u2013401 (2018). https:\/\/doi.org\/10.1287\/ijoc.2017.0782","journal-title":"INFORMS J. Comput."},{"key":"1875_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1249-5","author":"J Zou","year":"2018","unstructured":"Zou, J., Ahmed, S., Sun, X.A.: Stochastic dual dynamic integer programming. Math. Program. (2018). https:\/\/doi.org\/10.1007\/s10107-018-1249-5","journal-title":"Math. Program."},{"key":"1875_CR39","doi-asserted-by":"publisher","unstructured":"Zou, J., Ahmed, S., Sun, X.A.: Multistage Stochastic Unit Commitment Using Stochastic Dual Dynamic Integer Programming. IEEE Trans. Power Syst. 34(3), 1814\u20131823 (2019) https:\/\/doi.org\/10.1109\/TPWRS.2018.2880996. http:\/\/ieeexplore.ieee.org\/document\/8532315\/","DOI":"10.1109\/TPWRS.2018.2880996"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01875-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01875-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01875-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T23:34:16Z","timestamp":1667864056000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01875-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,20]]},"references-count":39,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["1875"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01875-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,20]]},"assertion":[{"value":"8 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}