Correction to: Complexity of stochastic dual dynamic programming

被引：0
|
作者：
Guanghui Lan
机构：
[1] Georgia Institute of Technology,H. Milton Stewart School of Industrial and Systems Engineering
来源：
Mathematical Programming | 2022年 / 194卷
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper, we point out some corrections needed in “Complexity of Stochastic Dual Dynamic Programming”, a paper accepted to Mathematical Programming, 2020, online-first issue,.
引用
收藏
页码：1187 / 1189
页数：2
相关论文
共 50 条
  • [1] Complexity of stochastic dual dynamic programming
    Guanghui Lan
    Mathematical Programming, 2022, 191 : 717 - 754
  • [2] Complexity of stochastic dual dynamic programming
    Lan, Guanghui
    MATHEMATICAL PROGRAMMING, 2022, 191 (02) : 717 - 754
  • [3] Complexity of stochastic dual dynamic programming (vol 191, pg 717, 2022)
    Lan, Guanghui
    MATHEMATICAL PROGRAMMING, 2022, 194 (1-2) : 1187 - 1189
  • [4] Stochastic dual dynamic integer programming
    Jikai Zou
    Shabbir Ahmed
    Xu Andy Sun
    Mathematical Programming, 2019, 175 : 461 - 502
  • [5] Stochastic dual dynamic integer programming
    Zou, Jikai
    Ahmed, Shabbir
    Sun, Xu Andy
    MATHEMATICAL PROGRAMMING, 2019, 175 (1-2) : 461 - 502
  • [6] Analysis of stochastic dual dynamic programming method
    Shapiro, Alexander
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 209 (01) : 63 - 72
  • [7] On conditional cuts for stochastic dual dynamic programming
    van Ackooij, W.
    Warin, X.
    EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2020, 8 (02) : 173 - 199
  • [8] INEXACT CUTS IN STOCHASTIC DUAL DYNAMIC PROGRAMMING
    Guigues, Vincent
    SIAM JOURNAL ON OPTIMIZATION, 2020, 30 (01) : 407 - 438
  • [9] Improving the performance of Stochastic Dual Dynamic Programming
    de Matos, Vitor L.
    Philpott, Andy B.
    Finardi, Erlon C.
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2015, 290 : 196 - 208
  • [10] DISTRIBUTIONALLY ROBUST STOCHASTIC DUAL DYNAMIC PROGRAMMING
    Duque, Daniel
    Morton, David P.
    SIAM JOURNAL ON OPTIMIZATION, 2020, 30 (04) : 2841 - 2865
12345