Minimizing the Average Cost of Testing Coherent Systems: Complexity and Approximate Algorithms

DOI10.1109/TR.1983.5221476zbMATH Open0514.90036OpenAlexW2006758822MaRDI QIDQ3661287FDOQ3661287

Piotr Jedrzejowicz

Publication date: 1983

Published in: IEEE Transactions on Reliability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tr.1983.5221476

zbMATH Keywords

computational complexityapproximate algorithmspolynomial-time algorithmoptimal testing policystate determinations-coherent system

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25)

Cited In (2)

• Sequential testing of complex systems: a review
• Computer science and decision theory

This page was built for publication: Minimizing the Average Cost of Testing Coherent Systems: Complexity and Approximate Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3661287)