Reliability evaluation in terms of flow data mining for multistate networks (Q2115808): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-020-03774-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3080728984 / 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: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / 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: A simple algorithm for reliability evaluation of a stochastic-flow network with node failure / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient searching method for minimal path vectors in multi-state networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the history of the transportation and maximum flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient enumeration of \(d\)-minimal paths in reliability evaluation of multistate networks / rank
 
Normal rank

Latest revision as of 10:26, 28 July 2024

scientific article
Language Label Description Also known as
English
Reliability evaluation in terms of flow data mining for multistate networks
scientific article

    Statements

    Reliability evaluation in terms of flow data mining for multistate networks (English)
    0 references
    0 references
    0 references
    21 March 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    flow data mining
    0 references
    minimum path
    0 references
    lower boundary vectors
    0 references
    exact enumeration
    0 references
    maximum flow
    0 references
    0 references