Pages that link to "Item:Q1296802"
From MaRDI portal
The following pages link to Computational assessment of distributed decomposition methods for stochastic linear programs (Q1296802):
Displaying 13 items.
- Dynamic portfolio optimization: time decomposition using the maximum principle with a scenario approach (Q704083) (← links)
- On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed \(0-1\) problems under uncertainty (Q889106) (← links)
- A comparative study of decomposition algorithms for stochastic combinatorial optimization (Q1001189) (← links)
- Analysis of stochastic problem decomposition algorithms in computational grids (Q1026583) (← links)
- The Benders decomposition algorithm: a literature review (Q1751891) (← links)
- Schumann, a modeling framework for supply chain management under uncertainty (Q1806755) (← links)
- On parallelizing dual decomposition in stochastic integer programming (Q2450615) (← links)
- On a distributed implementation of a decomposition method for multistage linear stochastic programs (Q2785399) (← links)
- A risk function for the stochastic modeling of electric capacity expansion (Q4330233) (← links)
- Algorithm 768: TENSOLVE (Q4375496) (← links)
- Distributed Semidefinite Programming With Application to Large-Scale System Analysis (Q4567160) (← links)
- Distributed Primal Decomposition for Large-Scale MILPs (Q5034033) (← links)
- An asynchronous parallel benders decomposition method for stochastic network design problems (Q6551056) (← links)
