An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. II: Parallelization
DOI10.1016/J.COR.2013.06.015zbMATH Open1348.90497OpenAlexW2003553510MaRDI QIDQ336664FDOQ336664
Authors: Unai Aldasoro, María Merino, Gloria Pérez, Laureano F. Escudero Bueno 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.06.015
Recommendations
- A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees
- On solving strong multistage nonsymmetric stochastic mixed 0-1 problems
- On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed \(0-1\) problems under uncertainty
- BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems
multistage stochastic mixed 0-1 optimizationbranch-and-fix coordinationbreak stage scenario clusteringMPI threadsouter and inner parallelization
Cites Work
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees
- The empirical behavior of sampling methods for stochastic programming
- Introduction to stochastic programming.
- Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
- An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
- Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming
- Parallel algorithms to solve two-stage stochastic linear programs with robustness constraints
- A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity
- Title not available (Why is that?)
Cited In (10)
- On solving strong multistage nonsymmetric stochastic mixed 0-1 problems
- Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees
- A parallelised distributed implementation of a branch and fix coordination algorithm
- On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed \(0-1\) problems under uncertainty
- On time stochastic dominance induced by mixed integer-linear recourse in multistage stochastic programs
- Cluster Lagrangean decomposition in multistage stochastic optimization
- A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems
- Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic
- Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization
Uses Software
This page was built for publication: An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. II: Parallelization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336664)
