Return to search

Stochastic branch & bound applying target oriented branch & bound method to optimal scenario tree reduction

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) / Series: Working Papers on Information Systems, Information Business and Operations

Identiferoai:union.ndltd.org:VIENNA/oai:epub.wu-wien.ac.at:epub-wu-01_252
Date January 2002
CreatorsStix, Volker
PublisherInstitut fĂĽr Informationsverarbeitung und Informationswirtschaft, WU Vienna University of Economics and Business
Source SetsWirtschaftsuniversität Wien
LanguageEnglish
Detected LanguageEnglish
TypePaper, NonPeerReviewed
Formatapplication/pdf
Relationhttp://epub.wu.ac.at/1212/

Page generated in 0.0018 seconds