|edoc-Server der Humboldt-Universität zu Berlin|
Yongpei Guan, University of Oklahoma|
Shabbir Ahmed, Georgia Institute of Technology
George L. Nemhauser, Georgia Institute of Technology
|Title:||Cutting planes for multi-stage stochastic integer programs|
|Date of Acceptance:||21.11.2006|
Stochastic Programming E-Print Series |
|Editors:||Julie L. Higle; Werner Römisch; Surrajeet Sen|
|Complete Preprint:||pdf (urn:nbn:de:kobv:11-10071635)|
|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.|
|This paper addresses the problem of finding cutting planes for multi-stage stochastic integer programs. We give a general method for generating cutting planes for multi-stage stochastic integer programs based on combining inequalities that are valid for the individual scenarios. We apply the method to generate cuts for a stochastic version of a dynamic knapsack problem and to stochastic lot sizing problems. We give computational results which show that these new inequalities are very effective in a branch-and-cut algorithm.|
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 Jun 2011: