.png){kind=icon}
Return
A New Solution Algorithm for the Multistate Minimal Cut Problem
.png){kind=icon}
PRE
AI
DOI：10.1109/TR.2019.2935630.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Reliability evaluation is a useful tool for network performance demonstration, and therefore has become an increasingly relevant task in network design and operation. The multistate minimal cut (called d-MC for short) method is a popular algorithm for reliability evaluation of multistate flow networks. This article focuses on d-MC problem, and presents some new results to improve its solution. Grounded on the newly obtained results, an algorithm is proposed to find d-MCs, together with discussions on its time complexity that compares favorably with the existing methods. An illustration of the presented algorithm is provided by solving a simple example. Furthermore, numerical experiments and a case study are conducted to demonstrate the advantage and the utility of the proposed algorithm, respectively.
Keywords:
Algorithm
minimal cut (MC)
multistate flow network
multistate minimal cut (d-MC)
reliability evaluation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.7
Papers:
2.8K
Citations:
8.5K
Organization
Cited Papers
Computing Multi-State Two-Terminal Reliability Through Critical Arc States That Interrupt Demand
.png){kind=icon}
PREAI
ShareSaveOptimal carrier selection based on network reliability criterion for stochastic logistics networks
PREAI
ShareSaveShareSave
ShareSaveShareSave
View more