|edoc-Server der Humboldt-Universität zu Berlin|
Lewis Ntaimo, Texas A&M University|
Suvrajeet Sen, The University of Arizona
|Title:||A Comparative Study of Decomposition Algorithms for Stochastic Combinatorial Optimization|
|Date of Acceptance:||29.12.2005|
Stochastic Programming E-Print Series |
|Editors:||Julie L. Higle; Werner Römisch; Surrajeet Sen|
|Complete Preprint:||pdf (urn:nbn:de:kobv:11-10059954)|
|Keywords (eng):||Stochastic mixed-integer programming, disjunctive decomposition, stochastic server location, strategic supply chain planning, stochastic matching|
|Appeared in:||Computational Optimization and Applications|
|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 presents comparative computational results using three decomposition algorithms on a battery of instances drawn from three different applications. In order to preserve the commonalities among the algorithms in our experiments, we have designed a testbed which is used to study instances arising in server location under uncertainty, strategic supply chain planning under uncertainty, and stochastic bipartitite matching. Insights related to alternative implementation issues leading to more efficient implementations, benchmarks for serial processing, and scalability of the methods are also presented. The computational experience demonstrates the promising potential of the disjunctive decomposition $(D^2)$ approach towards solving several large-scale problem instances from the three application areas. Furthermore, the study shows that convergence of the $D^2$ methods for stochastic combinatorial optimization (SCO) is in fact attainable since the methods scale well with the number of scenarios.|
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: