|
81 |
How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?
Akrida, Eleni C.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
|
82 |
Reachability for Branching Concurrent Stochastic Games (Track B: Automata, Logic, Semantics, and Theory of Programming)
Etessami, Kousha. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
|
83 |
Stochastic Graph Exploration
Anagnostōpulos, Arēs. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
|
84 |
Stochastic Online Metric Matching
Gupta, Anupam. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
85 |
A Bi-objective stochastic programming model for the household waste collection and transportation problem: case of the city of Sousse
Enthalten in Operational research 21.12.2019: 1-27
|
|
|
|
86 |
A multi-stage stochastic programming model of lot-sizing and scheduling problems with machine eligibilities and sequence-dependent setups
Enthalten in Annals of operations research 13.11.2019: 1-16
|
|
|
|
87 |
Electric power infrastructure planning under uncertainty: stochastic dual dynamic integer programming (SDDiP) and parallelization scheme
Enthalten in Optimization and engineering 16.10.2019: 1-39
|
|
|
|
88 |
Solving Stochastic Dynamic Programming Problems: A Mixed Complementarity Approach
Enthalten in Computational economics 4.10.2019: 1-31
|
|
|
|
89 |
A fuzzy robust stochastic mathematical programming approach for multi-objective scheduling of the surgical cases
Enthalten in Opsearch 14.5.2019: 1-21
|
|
|
|
90 |
On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems
Enthalten in Computational optimization and applications 2.5.2019: 1-42
|
|
Administration
