Computing optimal \((R, s, S)\) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming (Q2031075)

From MaRDI portal
Revision as of 14:11, 7 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q114851810, #quickstatements; #temporary_batch_1707303357582)
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
    0 references
    0 references
    0 references
    0 references
    8 June 2021
    0 references
    \((R, s, S)\) policy
    0 references
    demand uncertainty
    0 references
    stochastic lot sizing
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references