A branch and bound algorithm for computing optimal replacement policies in consecutivek-out-of-n-systems (Q4533475)

From MaRDI portal
Revision as of 03:41, 7 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q115150511, #quickstatements; #temporary_batch_1707252663060)
scientific article; zbMATH DE number 1753724
Language Label Description Also known as
English
A branch and bound algorithm for computing optimal replacement policies in consecutivek-out-of-n-systems
scientific article; zbMATH DE number 1753724

    Statements

    A branch and bound algorithm for computing optimal replacement policies in consecutivek-out-of-n-systems (English)
    0 references
    0 references
    0 references
    11 June 2002
    0 references
    optimal replacement policies
    0 references
    branch-and-bound algorithm
    0 references

    Identifiers