Zobrazeno 1 - 10
of 133
pro vyhledávání: '"scenario trees"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Laureano F. Escudero, Juan F. Monge
Publikováno v:
Mathematics, Vol 9, Iss 24, p 3177 (2021)
The hub location problem (HLP) basically consists of selecting nodes from a network to act as hubs to be used for flow traffic directioning, i.e., flow collection from some origin nodes, probably transfer it to other hubs, and distributing it to dest
Externí odkaz:
https://doaj.org/article/a16c888aacf54b668b3c8f6f08f7ca4a
Autor:
Angela Bullanday Scott, Jenny-Ann L. M. L. Toribio, Mini Singh, Peter Groves, Belinda Barnes, Kathryn Glass, Barbara Moloney, Amanda Black, Marta Hernandez-Jover
Publikováno v:
Frontiers in Veterinary Science, Vol 5 (2018)
This study quantified and compared the probability of avian influenza (AI) spread within and between Australian commercial chicken farms via specified spread pathways using scenario tree mathematical modeling. Input values for the models were sourced
Externí odkaz:
https://doaj.org/article/78daca736176408083da1618ccaa5e38
Autor:
Angela Bullanday Scott, Jenny-Ann Toribio, Mini Singh, Peter Groves, Belinda Barnes, Kathryn Glass, Barbara Moloney, Amanda Black, Marta Hernandez-Jover
Publikováno v:
Frontiers in Veterinary Science, Vol 5 (2018)
This study investigated the pathways of exposure to low pathogenic avian influenza (LPAI) virus among Australian commercial chicken farms and estimated the likelihood of this exposure occurring using scenario trees and a stochastic modeling approach
Externí odkaz:
https://doaj.org/article/30058f1155484f8c89fe9d0724db93a7
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Electric Power Systems Research
Electric Power Systems Research, 2022, 206, pp.107774. ⟨10.1016/j.epsr.2022.107774⟩
Electric Power Systems Research, Elsevier, 2022, 206, ⟨10.1016/j.epsr.2022.107774⟩
Electric Power Systems Research, 2022, 206, pp.107774. ⟨10.1016/j.epsr.2022.107774⟩
Electric Power Systems Research, Elsevier, 2022, 206, ⟨10.1016/j.epsr.2022.107774⟩
We propose a generic multistage stochastic model for the Alternating Current Optimal Power Flow (AC OPF) problem for radial distribution networks, to account for the random electricity production of renewable energy sources and dynamic constraints of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::08a11a345217dde31b1ed9bafab8bbdd
https://hal.archives-ouvertes.fr/hal-03236238
https://hal.archives-ouvertes.fr/hal-03236238
We compare two popular scenario tree generation methods in the context of financial optimization: Moment matching and scenario reduction. Using a simple problem with a known analytic solution, we find that moment matching - accompanied by a check to
Externí odkaz:
http://epub.wu.ac.at/4131/1/scenrednum25_SSRN.pdf
Autor:
Stix, Volker
In this article a new branch & bound method is described. It uses an artificial target to improve its bounding capabilities. Therefore the new approach is faster compared to the classical one. It is applied to the stochastic problem of optimal scenar
Externí odkaz:
http://epub.wu.ac.at/1212/1/document.pdf
Autor:
Uhliarik, Andrej
This thesis focuses on the stability of ALM models formulated as problems of multistage stochastic programming, with respect to reductions in scenario tree. In the first chapter, we introduce multistage stochastic programming problem and the chosen a
Externí odkaz:
http://www.nusl.cz/ntk/nusl-448373
Sequential decision problems under uncertainty are commonly studied with stochastic programing. An important modeling choice is the number of stages. More stages allow additional information to be captured, but is associated with a coarser representa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::256ef940f61d6ff50bd770586c4e2c3a
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-181642
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-181642