An algorithmic framework for solving large-scale multistage stochastic mixed 0–1 problems with nonsymmetric scenario trees
- 1 May 2012
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 39 (5) , 1133-1144
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacityComputers & Operations Research, 2011
- Stochastic set packing problemEuropean Journal of Operational Research, 2011
- A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durationsComputers & Operations Research, 2010
- 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
- BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0–1 problemsTOP, 2009
- Conditional Value-at-Risk in Stochastic Programs with Mixed-Integer RecourseMathematical Programming, 2005
- The Million-Variable “March” for Stochastic Combinatorial OptimizationJournal of Global Optimization, 2005
- Stochastic programming with integer variablesMathematical Programming, 2003
- Scenarios and Policy Aggregation in Optimization Under UncertaintyMathematics of Operations Research, 1991
- Stochastic Programs with Fixed Recourse: The Equivalent Deterministic ProgramSIAM Review, 1974