| Stochastic dual dynamic programming and its variants C Füllner, S Rebennack http://www.optimization-online.org/DB_FILE/2021/01/8217.pdf, 2021 | 23* | 2021 |
| Non-convex nested Benders decomposition C Füllner, S Rebennack Mathematical Programming 196 (1), 987-1024, 2022 | 20 | 2022 |
| Convergent upper bounds in global minimization with nonlinear equality constraints C Füllner, P Kirst, O Stein Mathematical Programming 187, 617-651, 2021 | 3 | 2021 |
| On Lipschitz regularization and Lagrangian cuts in multistage stochastic mixed-integer linear programming C Füllner, XA Sun, S Rebennack Available at Optimization Online, 2024 | 2 | 2024 |
| Feasibility Verification and Upper Bound Computation in Global Minimization Using Approximate Active Index Sets C Füllner, P Kirst, H Otto, S Rebennack INFORMS Journal on Computing, 2024 | 1 | 2024 |
| A new framework to generate Lagrangian cuts in multistage stochastic mixed-integer programming C Füllner, XA Sun, S Rebennack Available at Optimization Online, 2024 | 1 | 2024 |
| On approximating non-convex value functions in stochastic dual dynamic programming and related decomposition methods C Füllner | | 2024 |
| Stochastic Dual Dynamic Integer Programming C Füllner, S Zhang, S Rebennack, XA Sun Encyclopedia of Optimization, 1-11, 2022 | | 2022 |
