|
1 |
Identifying Approximate Minimizers Under Stochastic Uncertainity
Al-Thani, Hessa. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
2 |
Query Efficient Weighted Stochastic Matching
Derakhshan, Mahsa. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
3 |
Reducing Stochastic Games to Semidefinite Programming
Bodirsky, Manuel. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
4 |
Multi-resource allocation and care sequence assignment in patient management: a stochastic programming approach
Enthalten in Health care management science 30.5.2024: 1-18
|
|
|
|
5 |
Approximation of multistage stochastic programming problems by smoothed quantization
Enthalten in Review of managerial science 28.2.2024: 1-36
|
|
|
|
6 |
Black-Box Testing Liveness Properties of Partially Observable Stochastic Systems
Esparza, Javier. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
|
|
|
|
7 |
On Sparsification of Stochastic Packing Problems
Dughmi, Shaddin. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
|
|
|
|
8 |
Distribution-free algorithms for predictive stochastic programming in the presence of streaming data
Enthalten in Computational optimization and applications 22.9.2023: 1-41
|
|
|
|
9 |
Combining monthly wind and inflow uncertainties in the stochastic dual dynamic programming
Enthalten in Energy systems 3.6.2023: 1-38
|
|
|
|
10 |
Near-Optimal Algorithms for Stochastic Online Bin Packing
Ayyadevara, Nikhil ^*. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
Administration
