A practical bounding algorithm for computing two-terminal reliability based on decomposition technique (Q636690): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.camwa.2010.09.033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993210728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Network Reliability Analysis: An Overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reliability Bound for Systems of Maintained, Interdependent Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on two-terminal network reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical sequential bounds for approximating two-terminal reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of s-dimensional faces in a complex: An analogy between the simplex and the cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248175 / rank
 
Normal rank

Latest revision as of 09:56, 4 July 2024

scientific article
Language Label Description Also known as
English
A practical bounding algorithm for computing two-terminal reliability based on decomposition technique
scientific article

    Statements

    A practical bounding algorithm for computing two-terminal reliability based on decomposition technique (English)
    0 references
    0 references
    0 references
    28 August 2011
    0 references
    two-terminal reliability
    0 references
    decomposition technique
    0 references
    MP/MC
    0 references

    Identifiers