On the computational complexity of reliability redundancy allocation in a series system (Q1196218): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Programming Applied to Reliability Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability Optimization Problems with Multiple Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximative Algorithms for Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Approximation Schemes for Multidimensional Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization Techniques for System Reliability with RedundancyߞA Review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932565 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-6377(92)90008-q / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034629430 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:39, 30 July 2024

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
    0 references