On the computational complexity of reliability redundancy allocation in a series system
type: Item
instance of: scholarly article
title: On the computational complexity of reliability redundancy allocation in a series system
zbMATH Open document ID: 0767.90021
DOI: 10.1016/0167-6377(92)90008-Q
author: Maw-Sheng Chern
published in: Operations Research Letters
publication date: 1992-12-17T00:00:00Z
Mathematics Subject Classification ID: 90B25
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 77900
zbMATH Keywords: redundancy optimization
zbMATH Keywords: \(NP\)-completeness
zbMATH Keywords: greedy algorithm
zbMATH Keywords: \(NP\)- hardness
zbMATH Keywords: optimal redundancy
zbMATH Keywords: system reliability
zbMATH Keywords: knapsack problem
MaRDI profile type: Publication
cites work: Q5342246
cites work: Parametric Programming Applied to Reliability Optimization Problems
cites work: Reliability Optimization Problems with Multiple Constraints
cites work: Q4198056
cites work: Approximative Algorithms for Discrete Optimization Problems
cites work: Q3320130
cites work: A Note on Approximation Schemes for Multidimensional Knapsack Problems
cites work: Optimization Techniques for System Reliability with RedundancyߞA Review
cites work: Q3932565
full work available at URL: 0167-6377(92)90008-q
OpenAlex ID: W2034629430
description: scientific article; zbMATH DE number 77900