A parallel Branch-and-Fix Coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0–1 problems
Open Access
- 1 April 2017
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 258 (2) , 590-606
Abstract
No abstract availableKeywords
Funding Information
- European Commission (AYD-000-280)
This publication has 47 references indexed in Scilit:
- 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 hierarchy of bounds for stochastic mixed-integer programsMathematical Programming, 2012
- A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacityComputers & Operations Research, 2011
- Capacity expansion planning through augmented Lagrangian optimization and scenario decompositionAIChE Journal, 2011
- A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durationsComputers & Operations Research, 2010
- Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problemsComputational Management Science, 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
- Parallel processors for planning under uncertaintyAnnals of Operations Research, 1990
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962