Achieving System Reliability with the Fewest Identical Components
Benedict Nmah · Journal of Advances in Mathematics and Computer Science · 2017
Generally, redundancy allocation problems are NP-hard. This paper presents an explicit polynomially bounded algorithm for a special class of redundancy allocation models.
Open access
Research Article
10.9734/JAMCS/2017/36521