A dynamic bounding algorithm for approximating multi-state two-terminal reliability (Q976369): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2010.01.033 / rank
Normal rank
 
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.ejor.2010.01.033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001854852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational investigations of maximum flow algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability Evaluation of Multistate Systems with Multistate Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Network Reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5663623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability Bounds for Multistate Systems with Multistate Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability evaluation of a limited-flow network in terms of minimal cutsets / 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: A sum of disjoint products algorithm for reliability evaluation of flow networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm to search for all MCs in networks / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2010.01.033 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:54, 10 December 2024

scientific article
Language Label Description Also known as
English
A dynamic bounding algorithm for approximating multi-state two-terminal reliability
scientific article

    Statements

    A dynamic bounding algorithm for approximating multi-state two-terminal reliability (English)
    0 references
    0 references
    0 references
    11 June 2010
    0 references
    reliability
    0 references
    multi-state network
    0 references
    network flow
    0 references
    upper/lower bounds
    0 references

    Identifiers