A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks (Q2286903): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q126846067, #quickstatements; #temporary_batch_1722364966119
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2019.10.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2982546103 / 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: Computational Complexity of Network Reliability Analysis: An Overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing project makespan distributions: Markovian PERT networks revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient alternative to the exact evaluation of the quickest path flow network reliability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of system reliability for a stochastic delivery-flow distribution network with inventory / 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: A dynamic bounding algorithm for approximating multi-state two-terminal reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks / 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: 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: On sequence planning for selective maintenance of multi-state systems under stochastic maintenance durations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of bounds for two-terminal network reliability / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126846067 / rank
 
Normal rank

Latest revision as of 19:54, 30 July 2024

scientific article
Language Label Description Also known as
English
A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks
scientific article

    Statements

    A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks (English)
    0 references
    0 references
    0 references
    0 references
    23 January 2020
    0 references
    reliability
    0 references
    \(d\)-MP
    0 references
    minimal cuts
    0 references
    multi-state flow network
    0 references
    parallel computing
    0 references

    Identifiers