A novel node-based sequential implicit enumeration method for finding all \(d\)-MPs in a multistate flow network (Q527215): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Yeh, Wei-Chang / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6715900 / rank
 
Normal rank
Property / zbMATH Keywords
 
multi-state flow network
Property / zbMATH Keywords: multi-state flow network / rank
 
Normal rank
Property / zbMATH Keywords
 
network reliability
Property / zbMATH Keywords: network reliability / rank
 
Normal rank
Property / zbMATH Keywords
 
\(d\)-MP
Property / zbMATH Keywords: \(d\)-MP / rank
 
Normal rank
Property / zbMATH Keywords
 
implicit enumeration method
Property / zbMATH Keywords: implicit enumeration method / rank
 
Normal rank
Property / author
 
Property / author: Yeh, Wei-Chang / 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.ins.2014.11.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967937764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / 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: Maximal Flow Through a Network / 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: Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method to evaluate routing policy through \(p\) minimal paths for stochastic case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical bounding algorithm for computing two-terminal reliability based on decomposition technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability evaluation of multi-state systems under cost consideration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999466 / 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: Evaluating the reliability of a novel deterioration-effect multi-state flow network / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:20, 13 July 2024

scientific article
Language Label Description Also known as
English
A novel node-based sequential implicit enumeration method for finding all \(d\)-MPs in a multistate flow network
scientific article

    Statements

    A novel node-based sequential implicit enumeration method for finding all \(d\)-MPs in a multistate flow network (English)
    0 references
    16 May 2017
    0 references
    multi-state flow network
    0 references
    network reliability
    0 references
    \(d\)-MP
    0 references
    implicit enumeration method
    0 references
    0 references

    Identifiers