Achieving System Reliability with the Fewest Identical Components

Benedict Nmah

doi:10.9734/JAMCS/2017/36521

Research Article Open access CC BY 4.0

Achieving System Reliability with the Fewest Identical Components

Benedict Nmah

Journal of Advances in Mathematics and Computer Science · pp. 1–9 · Published 4 Oct 2017

10.9734/JAMCS/2017/36521

Abstract

Generally, redundancy allocation problems are NP-hard. This paper presents an explicit polynomially bounded algorithm for a special class of redundancy allocation models.

NP-hard polynomially bounded algorithms redundancy allocation discrete optimization models

Cited by 0

No indexed citations yet.

Access this article

View at publisher

Cite this article

Benedict Nmah (2017). Achieving System Reliability with the Fewest Identical Components. Journal of Advances in Mathematics and Computer Science , 1–9. https://doi.org/10.9734/JAMCS/2017/36521

Affiliations

Benedict Nmah — Department of Mathematics, Morehouse College, 830 Westview Drive, S.W., Atlanta, GA 30314, USA.

Metrics

0
Views: 0
Downloads: 0
Citations: 0
Outbound

Full metrics

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

0

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.