Decomposition Algorithms for Stochastic Programming on a Computational Grid
Authors:
- 1 February 2003
- journal article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 24 (2-3) , 207-250
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Master–Worker: An Enabling Framework for Applications on the Computational GridCluster Computing, 2001
- Building and Solving Large-Scale Stochastic Programs on an Affordable Distributed Computing SystemAnnals of Operations Research, 2000
- On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic ProgramsSIAM Journal on Optimization, 2000
- A New Scenario Decomposition Method for Large-Scale Stochastic OptimizationOperations Research, 1995
- Network planning with random demandTelecommunication Systems, 1994
- Parallel decomposition of multistage stochastic programming problemsMathematical Programming, 1993
- Proximity control in bundle methods for convex nondifferentiable minimizationMathematical Programming, 1990
- Computing Block-Angular Karmarkar Projections with Applications to Stochastic ProgrammingManagement Science, 1988
- A regularized decomposition method for minimizing a sum of polyhedral functionsMathematical Programming, 1986
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic ProgrammingSIAM Journal on Applied Mathematics, 1969