|edoc-Server der Humboldt-Universität zu Berlin|
|Author(s):||Shane Dye, University of Canterbury, New Zealand||Title:||Subtree decomposition for multistage stochastic programs|
|Date of Acceptance:||20.06.2003|
Stochastic Programming E-Print Series |
|Editors:||Julie L. Higle; Werner Römisch; Surrajeet Sen|
|Complete Preprint:||pdf (urn:nbn:de:kobv:11-10059063)|
|Keywords (eng):||decomposition, Stochastic programming, scenario tree, progressive hedging|
|Metadata export: To export the complete metadata set as Endote or Bibtex format please click to the appropriate link.||Endnote Bibtex|
|print on demand: If you click on this icon you can order a print copy of this publication.|
|Diese Seite taggen: These icons lead to social bookmarking systems where you can create and manage personal bookmarks and discover bookmakrs of other users.|
|An algorithm for solving multistage stochastic recourse problems is described. The scenario tree is decomposed using a cover of subtrees. The progressive hedging algorithm is used to ensure implementability across the entire tree. The approach leads to a class of methods which includes the original implementation of the progressive hedging algorithm. Computational testing indicates that the method can provide improved performance. The subtree decomposition methodology may be applied to a number of existing stochastic programming algorithms.|
These data concerning access statistics for individual documents
have been compiled using the webserver log files aggregated by AWSTATS.
They refer to a monthly access count to the full text documents as well as to the entry page.
As for format versions of a document which consist of multiple files (such as HTML) the highest monthly access number to one of the files (chapters) is shown respectivly.
To see the detailled access numbers please move the mouse pointer over the single bars of the digaram.
Gesamtzahl der Zugriffe seit May 2011: