Building and solving large-scale stochastic programs on an affordable distributed computing system
From MaRDI portal
Recommendations
- Solving multistage stochastic network programs on massively prallel computers
- A scalable bounding method for multistage stochastic programs
- Computational assessment of distributed decomposition methods for stochastic linear programs
- Parallel distributed-memory simplex for large-scale stochastic LP problems
- scientific article; zbMATH DE number 1163102
Cited in
(13)- A practical implementation of stochastic programming: an application to the evaluation of option contracts in supply chains
- Solving multistage stochastic network programs on massively prallel computers
- An accelerated L-shaped method for solving two-stage stochastic programs in disaster management
- Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse
- Multicut Benders decomposition algorithm for process supply chain planning under uncertainty
- A primal-dual decomposition algorithm for multistage stochastic convex programming
- An embarrassingly parallel method for large-scale stochastic programs
- scientific article; zbMATH DE number 3878755 (Why is no real title available?)
- An effective heuristic for multistage linear programming with a stochastic right-hand side
- Optimal number of hosts in a distributed system based on cost criteria
- Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs
- Improving the computational efficiency of stochastic programs using automated algorithm configuration: an application to decentralized energy systems
- Automatic formulation of stochastic programs via an algebraic modeling language
This page was built for publication: Building and solving large-scale stochastic programs on an affordable distributed computing system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5933834)
