2 citations · 2 across the 5 of their papers we have counts for
6 papers
An Efficient Algorithm for the Quickest Path Reliability Problem
Majid Forghani-elahabad
The quickest path reliability problem is to compute the probability that a given flow is transmitted along a single source-destination path within a given time limit. When a budget…
Assessing the reliability of multistate flow networks considering distance constraints
Majid Forghani-elahabad
Evaluating the reliability of complex technical networks, such as those in energy distribution, logistics, and transportation systems, is of paramount importance. These networks ar…
An alternative approach to the exact network reliability assessment through the quickest path
Majid Forghani-elahabad
Extending the quickest path problem to the network reliability, a new problem emerged which aims to assess the network reliability for transmitting at least d units of data from a…
Assessing the performance of smart grid communication networks under both time and budget constraints
Majid Forghani-elahabad
The smart grid concept has emerged to address the existing problems in the traditional electric grid, which has been functioning for more than a hundred years. The most crucial dif…
Technical Notes on "A new approach to the d-MC problem"
Majid Forghani-elahabad, Nezam Mahdavi-Amiri
System reliability is the probability of the maximum flow in a stochastic-flow network from the source node to the sink node being more than a demand level d. There are several app…
A note on "A simple algorithm to search for all MCs in networks"
Majid Forghani-elahabad, Nezam Mahdavi-Amiri
Recently, Yeh [Yeh, WC. (2006). A simple algorithm to search for all MCs in networks. European Journal of Operational Research, 174, 1694{1705.] has proposed a simple algorithm to…