Pages that link to "Item:Q724127"

The following pages link to Computing non-stationary \((s, S)\) policies using mixed integer linear programming (Q724127):

Displaying 9 items.

• The stochastic lot sizing problem with piecewise linear concave ordering costs (Q342128) (← links)
• Optimality of \((s,S)\) policies with nonlinear processes (Q523979) (← links)
• Modelling and computing \((R^{n}, S^{n})\) policies for inventory systems with non-stationary stochastic demand (Q858399) (← links)
• Computing optimal \((R, s, S)\) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming (Q2031075) (← links)
• Approximations for non-stationary stochastic lot-sizing under \((s,Q)\)-type policy (Q2076831) (← links)
• Constraint programming for computing non-stationary \((R, S)\) inventory policies (Q2482781) (← links)
• On the stochastic inventory problem under order capacity constraints (Q6090156) (← links)
• Stochastic dynamic programming heuristic for the \((R,s,S)\) policy parameters computation (Q6106598) (← links)
• A simple heuristic for computing non-stationary inventory policies based on function approximation (Q6565432) (← links)