A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems
type: Item
instance of: scholarly article
title: A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems
zbMATH Open document ID: 1394.90443
author: Unai Aldasoro
author: María Merino
author: Gloria Pérez
author: Laureano F. Escudero Bueno
published in: European Journal of Operational Research
publication date: 2018-05-25T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6873529
zbMATH Keywords: multistage stochastic mixed 0-1 optimization
zbMATH Keywords: matheuristic
zbMATH Keywords: branch-and-fix coordination
zbMATH Keywords: break stage scenario clustering
zbMATH Keywords: parallel computing
zbMATH Keywords: message-passing interface
describes a project that uses: CPLEX
describes a project that uses: SUTIL
describes a project that uses: COIN-OR
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.08.072
OpenAlex ID: W2512970032
cites work: A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity
cites work: An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. II: Parallelization
cites work: On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed \(0-1\) problems under uncertainty
cites work: Q5416128
cites work: Regularized Decomposition of High-Dimensional Multistage Stochastic Programs with Markov Uncertainty
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Parallel algorithms to solve two-stage stochastic linear programs with robustness constraints
cites work: Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs
cites work: A parallel implementation of the nested decomposition algorithm for multistage stochastic linear programs
cites work: Introduction to Stochastic Programming
cites work: On stochastic dynamic programming for solving large-scale planning problems under uncertainty
cites work: Parallel processors for planning under uncertainty
cites work: Parallel computing applied to the stochastic dynamic programming for long term operation planning of hydrothermal power systems
cites work: On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming
cites work: A parallel computation approach for solving multistage stochastic network problems
cites work: BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems
cites work: On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming
cites work: An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees
cites work: On time stochastic dominance induced by mixed integer-linear recourse in multistage stochastic programs
cites work: Cluster Lagrangean decomposition in multistage stochastic optimization
cites work: An SDP approach for multiperiod mixed 0-1 linear programming models with stochastic dominance constraints for risk management
cites work: Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs
cites work: Q4178782
cites work: Lagrangean relaxation. (With comments and rejoinder).
cites work: SDDP for some interstage dependent risk-averse problems and application to hydro-thermal planning
cites work: Q4003964
cites work: Q4309474
cites work: Modeling with Stochastic Programming
cites work: A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations
cites work: The empirical behavior of sampling methods for stochastic programming
cites work: A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
cites work: A heuristic procedure for stochastic integer programs with complete recourse
cites work: Q3065430
cites work: A New Scenario Decomposition Method for Large-Scale Stochastic Optimization
cites work: Scalable parallel Benders decomposition for stochastic linear programming
cites work: A parallelised distributed implementation of a branch and fix coordination algorithm
cites work: Multi-stage stochastic optimization applied to energy planning
cites work: Multistage Stochastic Optimization
cites work: Q4838490
cites work: Scenarios and Policy Aggregation in Optimization Under Uncertainty
cites work: Parallel decomposition of multistage stochastic programming problems
cites work: On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
cites work: A hierarchy of bounds for stochastic mixed-integer programs
cites work: Multistage Stochastic Decomposition: A Bridge between Stochastic Programming and Approximate Dynamic Programming
cites work: Lectures on Stochastic Programming
cites work: Risk neutral and risk averse stochastic dual dynamic programming method
cites work: L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
cites work: Scalable parallel computations for large-scale stochastic programming
cites work: Applications of Stochastic Programming
cites work: Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems
cites work: Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
DOI: 10.1016/J.EJOR.2016.08.072