Solving stochastic programs with network recourse
From MaRDI portal
Recommendations
- Preprocessing in Stochastic Programming: The Case of Uncapacitated Networks
- Preprocessing in Stochastic Programming: The Case of Capacitated Networks
- Solving stochastic programs with simple recourse
- scientific article; zbMATH DE number 4089323
- Restricted recourse strategies for bounding the expected network recourse function
Cites work
Cited in
(15)- Solving multistage stochastic networks: An application of scenario aggregation
- A piecewise linear upper bound on the network recourse function
- Refining bounds for stochastic linear programs with linearly transformed independent random variables
- Bounding the expected time-cost curve for a stochastic PERT network from below
- Solving many linear programs that differ only in the right-hand side
- Solving multistage stochastic network programs on massively prallel computers
- The stochastic location-assignment problem on a tree
- An arc-exchange decomposition method for multistage dynamic networks with random arc capacities
- On the expected value of stochastic linear programs and (dynamic) network flow problems
- Applying the progressive hedging algorithm to stochastic generalized networks
- Siting noxious facilities under uncertainty
- Random equilibrium problems on networks
- Preprocessing in Stochastic Programming: The Case of Capacitated Networks
- Preprocessing in Stochastic Programming: The Case of Uncapacitated Networks
- Reformulation and sampling to solve a stochastic network interdiction problem
This page was built for publication: Solving stochastic programs with network recourse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787792)