On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed 0–1 problems under uncertainty
- 28 January 2015
- journal article
- Published by Springer Nature in TOP
- Vol. 23 (3) , 703-742
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Scenario Cluster Decomposition of the Lagrangian dual in two-stage stochastic mixed 0–1 optimizationComputers & Operations Research, 2013
- Risk neutral and risk averse Stochastic Dual Dynamic Programming methodEuropean Journal of Operational Research, 2013
- An algorithmic framework for solving large-scale multistage stochastic mixed 0–1 problems with nonsymmetric scenario treesComputers & Operations Research, 2012
- A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacityComputers & Operations Research, 2011
- An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: Some theoretical and experimental aspectsEuropean Journal of Operational Research, 2010
- On stochastic dynamic programming for solving large-scale planning problems under uncertaintyComputers & Operations Research, 2009
- Analysis of stochastic problem decomposition algorithms in computational gridsAnnals of Operations Research, 2008
- A Riccati-based primal interior point solver for multistage stochastic programmingEuropean Journal of Operational Research, 2002
- Parallel algorithms to solve two-stage stochastic linear programs with robustness constraintsParallel Computing, 2000
- Computational assessment of distributed decomposition methods for stochastic linear programsEuropean Journal of Operational Research, 1998