|
|
Sie wollen einen permanenten Link direkt zu diesem Dokument,
um ihn z.B. auf Ihrer Webseite zu platzieren?
Benutzen Sie: http://epub.wu-wien.ac.at/dyn/openURL?id=oai:epub.wu-wien.ac.at:epub-wu-01_252
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 scenario tree reduction. The aspects of global optimization are emphasized here. All necessary components for that problem are developed and some experimental results underline the benefits of the new approach. (author's abstract)
Branch-and-Bound-Methode / globale Optimierung / scenario trees / global optimization / stochastic branch and bound
© 2009 Universitätsbibliothek, WU | Technologie und Infrastruktur: Inst. f. Informationswirtschaft | Erstellt für Sie am: 9.2.2010 |