Pages that link to "Item:Q2031075"
From MaRDI portal
The following pages link to Computing optimal \((R, s, S)\) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming (Q2031075):
Displaying 4 items.
- Confidence-based optimisation for the newsvendor problem under binomial, Poisson and exponential demand (Q297378) (← links)
- Computing non-stationary \((s, S)\) policies using mixed integer linear programming (Q724127) (← links)
- Approximations for non-stationary stochastic lot-sizing under \((s,Q)\)-type policy (Q2076831) (← links)
- Stochastic dynamic programming heuristic for the \((R,s,S)\) policy parameters computation (Q6106598) (← links)
