A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is
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 todoi:10.1007/s10589-007-9085-1 fatcat:m46oa2a6ejbwhdkcxuafx4ftnu