An algorithmic framework for solving large-scale multistage stochastic mixed 0–1 problems with nonsymmetric scenario trees. Part II: Parallelization
- 1 December 2013
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 40 (12) , 2950-2960
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Scenario Cluster Decomposition of the Lagrangian dual in two-stage stochastic mixed 0–1 optimizationComputers & Operations 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
- On BFC-MSMIP strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programmingComputers & Operations Research, 2010
- The empirical behavior of sampling methods for stochastic programmingAnnals of Operations Research, 2006
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0–1 programsEuropean Journal of Operational Research, 2003
- An Approach for Strategic Supply Chain Planning under Uncertainty based on Stochastic 0-1 ProgrammingJournal of Global Optimization, 2003
- Parallel algorithms to solve two-stage stochastic linear programs with robustness constraintsParallel Computing, 2000
- Stochastic Programs with Fixed Recourse: The Equivalent Deterministic ProgramSIAM Review, 1974