On the computational complexity of reliability redundancy allocation in a series system
Publication:1196218
DOI10.1016/0167-6377(92)90008-QzbMath0767.90021OpenAlexW2034629430MaRDI QIDQ1196218
Publication date: 17 December 1992
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(92)90008-q
greedy algorithmsystem reliabilityknapsack problem\(NP\)-completenessredundancy optimizationoptimal redundancy\(NP\)- hardness
Applications of mathematical programming (90C90) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (53)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parametric Programming Applied to Reliability Optimization Problems
- A Note on Approximation Schemes for Multidimensional Knapsack Problems
- Optimization Techniques for System Reliability with RedundancyߞA Review
- Approximative Algorithms for Discrete Optimization Problems
- Reliability Optimization Problems with Multiple Constraints
This page was built for publication: On the computational complexity of reliability redundancy allocation in a series system