Computing optimal \((R, s, S)\) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming (Q2031075): Difference between revisions
From MaRDI portal
Latest revision as of 22:05, 25 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing optimal \((R, s, S)\) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming |
scientific article |
Statements
Computing optimal \((R, s, S)\) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming (English)
0 references
8 June 2021
0 references
\((R, s, S)\) policy
0 references
demand uncertainty
0 references
stochastic lot sizing
0 references
0 references
0 references
0 references
0 references
0 references