Analysis of stochastic problem decomposition algorithms in computational grids
From MaRDI portal
Recommendations
- Decomposition algorithms for stochastic programming on a computational grid
- A New Scenario Decomposition Method for Large-Scale Stochastic Optimization
- Computational assessment of distributed decomposition methods for stochastic linear programs
- A scenario decomposition algorithm for 0-1 stochastic programs
- On a distributed implementation of a decomposition method for multistage linear stochastic programs
Cites work
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- A decomposition methodology applied to the multi-area optimal power flow problem
- A New Scenario Decomposition Method for Large-Scale Stochastic Optimization
- A parallel implementation of the nested decomposition algorithm for multistage stochastic linear programs
- Decomposition algorithms for stochastic programming on a computational grid
- Decomposition techniques in mathematical programming. Engineering and science applications.
- FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver
- scientific article; zbMATH DE number 833651 (Why is no real title available?)
- scientific article; zbMATH DE number 839542 (Why is no real title available?)
- Introduction to Stochastic Programming
- Parallel Decomposition: Results for Staircase Linear Programs
- Parallelization and aggregation of nested Benders decomposition
- Parallelizing the Dual Simplex Method
- Partitioning procedures for solving mixed-variables programming problems
- Scalable parallel Benders decomposition for stochastic linear programming
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Solving large MINLPs on computational grids
- Solving large quadratic assignment problems on computational grids
- Some Computer Organizations and Their Effectiveness
- The Efficiency of the Simplex Method: A Survey
Cited in
(7)- Decomposition algorithms for stochastic programming on a computational grid
- Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse
- Multicut Benders decomposition algorithm for process supply chain planning under uncertainty
- Computational grids for stochastic programming
- An asynchronous parallel benders decomposition method for stochastic network design problems
- A combined SDDP/Benders decomposition approach with a risk-averse surface concept for reservoir operation in long term power generation planning
- On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed \(0-1\) problems under uncertainty
This page was built for publication: Analysis of stochastic problem decomposition algorithms in computational grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1026583)
