Pages that link to "Item:Q3770284"
From MaRDI portal
The following pages link to A piecewise linear upper bound on the network recourse function (Q3770284):
Displaying 13 items.
- An arc-exchange decomposition method for multistage dynamic networks with random arc capacities (Q296965) (← links)
- Generalized decision rule approximations for stochastic programming via liftings (Q494331) (← links)
- Bounding multi-stage stochastic programs from above (Q689156) (← links)
- A tighter variant of Jensen's lower bound for stochastic programs and separable approximations to recourse functions (Q1042140) (← links)
- Solving many linear programs that differ only in the right-hand side (Q1108193) (← links)
- Sublinear upper bounds for stochastic programs with recourse (Q1115346) (← links)
- Bounding separable recourse functions with limited distribution information (Q1178445) (← links)
- Restricted recourse strategies for bounding the expected network recourse function (Q1918432) (← links)
- An upper bound on the expected value of a non-increasing convex function with convex marginal return functions (Q1919193) (← links)
- Single-commodity network design with random edge capacities (Q1926752) (← links)
- Designing a majorization scheme for the recourse function in two-stage stochastic linear programming (Q2366830) (← links)
- A successive convex approximation method for multistage workforce capacity planning problem with turnover (Q2469579) (← links)
- On the safe side of stochastic programming: bounds and approximations (Q6056888) (← links)
