.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Algorithm
minimal cut (MC)
multistate flow network
multistate minimal cut (d-MC)
reliability evaluation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.7
论文数:
2.8K
被引数:
8.5K
机构
引用论文
Computing Multi-State Two-Terminal Reliability Through Critical Arc States That Interrupt Demand
.png){kind=icon}
PREAI
分享收藏Optimal carrier selection based on network reliability criterion for stochastic logistics networks
PREAI
分享收藏
Decision Diagram Based Methods and Complexity Analysis for Multi-State Systems基于决策图的多状态系统复杂性分析方法
PREAI
分享收藏分享收藏
查看更多内容