|
On Search for all d-MCs in a Network Flow
|
| |
|
|
|
چکیده: (29338 مشاهده) |
| A number of problems in several areas such as power transmission and distribution, communication and transportation can be formulated as a stochastic-flow network (SFN). The system reliability of an SFN can be computed in terms of all the upper boundary points, called d-MinCuts (d-MCs). Several algorithms have been proposed to find all the d-MCs in an SFN. Here, some recent studies in the literature on search for all d-MCs are investigated. We show that some existing results and the corresponding algorithms are incorrect. Then, correct versions of the results are established. By modifying an incorrect algorithm, we also propose an improved algorithm. In addition, complexity results on a number of studies are shown to be erroneous and correct counts are provided. Finally, we present comparative numerical results in the sense of performance profile of Dolan and Moré showing the proposed algorithm to be more efficient than some existing algorithms. |
|
| |
|
|
متن کامل [PDF 801 kb]
(38178 دریافت)
|
نوع مطالعه: پژوهشی |
موضوع مقاله:
Discrete Optimization
دریافت: 1391/5/30 | پذیرش: 1392/2/2 | انتشار: 1393/8/9
|
|
|
|
|
|
|
| ارسال نظر درباره این مقاله |
|
|
|
