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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Economical Design of Large Consecutive-k-out-of-n:F Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability of Consecutive-k-out-of-n:F System / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Bound Algorithm for Computing Optimal Replacement Policies in <i>K</i>-Out-of-<i>N</i> Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4367300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal replacement policies for a multicomponent reliability system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Solutions for Consecutive-k-out-of-n: F System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Allocation of Components in a Special 2-Port Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of maintenance models: The control and surveillance of deteriorating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal maintenance models for systems subject to failure–A Review / rank
 
Normal rank

Latest revision as of 10:30, 4 June 2024

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
    0 references
    11 June 2002
    0 references
    0 references
    optimal replacement policies
    0 references
    branch-and-bound algorithm
    0 references
    0 references
    0 references