On the computational complexity of reliability redundancy allocation in a series system (Q1196218)

From MaRDI portal
Revision as of 20:20, 14 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the computational complexity of reliability redundancy allocation in a series system
scientific article

    Statements

    On the computational complexity of reliability redundancy allocation in a series system (English)
    0 references
    0 references
    17 December 1992
    0 references
    redundancy optimization
    0 references
    \(NP\)-completeness
    0 references
    greedy algorithm
    0 references
    \(NP\)- hardness
    0 references
    optimal redundancy
    0 references
    system reliability
    0 references
    knapsack problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references