Loading...
Search for:
-d-t-b-p-inf-1--inf--p-inf-2--inf---mp
0.006 seconds
An efficient algorithm for the multi-state two separate minimal paths reliability problem with budget constraint
, Article Reliability Engineering and System Safety ; Volume 142 , October , 2015 , Pages 472-481 ; 09518320 (ISSN) ; Mahdavi Amiri, N ; Sharif University of Technology
Elsevier Ltd
2015
Abstract
Abstract Several researchers have worked on transmitting a given amount of flow through a network flow within fastest possible time, allowing flow to be transmitted through one or more paths. Extending this problem to the system reliability problem, the quickest path reliability problem has been introduced. The problem evaluates the probability of transmitting some given amount of flow from a source node to a sink node through a single minimal path in a stochastic-flow network within some specified units of time. Later, the problem has been extended to allow flow to be transmitted through two or more separate minimal paths (SMPs). Here, we consider the problem of sending flow through two...