Name
Abstract | ||
|---|---|---|
System reliability of a multistate flow network can be computed in terms of all the lower boundary points, called d-minimal paths (d-MPs). Although several algorithms have been proposed in the literature for the d-MP problem, there is still room for improvement upon its solution. Here, some new results are presented to improve the solution of the problem. A simple novel algorithm is improved to so... |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TR.2017.2712661 | IEEE Transactions on Reliability |
Keywords | Field | DocType |
Reliability,Smart grids,Complexity theory,Data structures,Communication networks,Upper bound,Erbium | Flow network,Data structure,Telecommunications network,Smart grid,Upper and lower bounds,Computer science,Algorithm,Diophantine equation,Smart grid communication | Journal |
Volume | Issue | ISSN |
66 | 3 | 0018-9529 |
Citations | PageRank | References |
1 | 0.35 | 18 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Majid Forghani-elahabad | 1 | 21 | 3.42 |
| Luiz Henrique Bonani | 2 | 6 | 3.25 |