Pages that link to "Item:Q5136076"

The following pages link to An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem (Q5136076):

Displaying 9 items.

• The dynamic bowser routing problem (Q1711454) (← links)
• Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure (Q2029964) (← 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)
• A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times (Q2668748) (← links)
• Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution (Q5060792) (← links)
• Comparison of different approaches to multistage lot sizing with uncertain demand (Q6080612) (← links)
• Stochastic dynamic programming heuristic for the \((R,s,S)\) policy parameters computation (Q6106598) (← links)
• The stochastic inventory routing problem on electric roads (Q6113317) (← links)