On matroid base families and the reliability computation of totally amenable systems

MaRDI QIDQ4251685zbMATH OpenFDO

Authors Andreas Behr, L. Camarinopoulos

Publication date 8 November 2000

zbMATH Keywords

coherent binary systemsdomination theorymatroidstotal amenability

Mathematics Subject Classification ID

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

Recommendations

• Reliable assignments of processors to tasks and factoring on matroids
• Computational Complexity of Coherent Systems and the Reliability Polynomial
• Oriented matroid systems
• scientific article; zbMATH DE number 4183154

Cited in

(3)

• scientific article; zbMATH DE number 2174607 (Why is no real title available?)
• Oriented matroid systems
• Reliable assignments of processors to tasks and factoring on matroids

This page was built for publication: On matroid base families and the reliability computation of totally amenable systems

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