Pages that link to "Item:Q2668748"

The following pages link to A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times (Q2668748):

Displaying 2 items.

• Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount (Q2669493) (← links)
• Stochastic dynamic programming heuristic for the \((R,s,S)\) policy parameters computation (Q6106598) (← links)