An improved algorithm for finding all upper boundary points in a stochastic-flow network
详细信息 查看全文
- 作者：Majid Forghani-elahabada ; m.forghani@ufabc.edu.br" class="auth_mail" title="E-mail the corresponding author ; forghanimajid@gmail.com" class="auth_mail" title="E-mail the corresponding author ; Nezam Mahdavi-Amiri ; b ; nezamm@sharif.edu" class="auth_mail" title="E-mail the corresponding author ; nezamm@sina.sharif.edu" class="auth_mail" title="E-mail the corresponding author
- 关键词：Reliability ; Stochastic-flow network ; d-MinCut (d-MC) ; Sum of disjoint products method
- 刊名：Applied Mathematical Modelling
- 出版年：2016
- 出版时间：15 February 2016
- 年：2016
- 卷：40
- 期：4
- 页码：3221-3229
- 全文大小：499 K
文摘
- •
Presenting new results to improve upon algorithms for the d-MC problem.
- •
Proposing a novel algorithm to solve a Diophantine system arising in the problem.
- •
Showing comparative efficiency of the proposed algorithm by complexity results.
- •
Showing practical efficiency of the algorithm by comparative testing.