Katalog der Deutschen Nationalbibliothek

Neuigkeiten Servicezeiten in Frankfurt am Main ab 1. Dezember 2025: Montag bis Freitag 9–18 Uhr und Samstag 10–16 Uhr
Service hours in Frankfurt am Main from 1 December 2025: Monday to Friday 9:00-18:00 and Saturday 10:00-16:00
 
Neuigkeiten

Leichte Bedienung, intuitive Suche: Die Betaversion unseres neuen Katalogs ist online! → Zur Betaversion des neuen DNB-Katalogs

 
Neuigkeiten 24. Dezember 2025 bis 1. Januar 2026: Die Deutsche Nationalbibliothek bleibt an beiden Standorten geschlossen. // 24 December 2025 to 1 January 2026: The German National Library will be closed at both locations.
 
 
 


Ergebnis der Suche nach: tit all "Stochastic Programming"
im Bestand: Gesamter Bestand

81 - 90 von 456
<< < > >>


Artikel 81 New extremal principles with applications to stochastic and semi-infinite programming
Enthalten in Mathematical programming 23.7.2020: 1-27
Online Ressource
Artikel 82 Assessing the value of natural gas underground storage in the Brazilian system via stochastic dual dynamic programming
Enthalten in Top 4.7.2020: 1-19
Online Ressource
Artikel 83 Economic evaluation of a CHP biomass plant using stochastic dual dynamic programming
Enthalten in Electrical engineering 3.7.2020: 1-11
Online Ressource
Artikel 84 Correction to: Towards a stochastic programming modeling framework for districting
Enthalten in Annals of operations research 8.6.2020: 1
Online Ressource
Artikel 85 Integration of Optimal Time-of-Use Pricing in Stochastic Programming for Energy and Reserve Management in Smart Micro-grids
Enthalten in Iranian journal of science and technology / Transactions of electrical engineering 9.5.2020: 1-18
Online Ressource
Artikel 86 Measuring and optimizing system reliability: a stochastic programming approach
Enthalten in Top 22.2.2020: 1-20
Online Ressource
Artikel 87 Solving Lagrangian variational inequalities with applications to stochastic programming
Enthalten in Mathematical programming 8.1.2020: 1-17
Online Ressource
Online Ressourcen 88 How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?
Akrida, Eleni C.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
Online Ressource
Online Ressourcen 89 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
Online Ressource
Online Ressourcen 90 Stochastic Graph Exploration
Anagnostōpulos, Arēs. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
Online Ressource


81 - 90 von 456
<< < > >>


E-Mail-IconAdministration