文件名称:constraint
介绍说明－－下载内容均来自于网络，请自行研究使用
This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may
fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is
not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then
the system reliability can be calculated in terms of such points. One computer example is shown to illustrate
the solution procedure.-This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may
fail. Given the demand d, we try to evaluate the system reliability that the maximum#ow of the network is
not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then
the system reliability can be calculated in terms of such points. One computer example is shown to illustrate
the solution procedure.
fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is
not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then
the system reliability can be calculated in terms of such points. One computer example is shown to illustrate
the solution procedure.-This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may
fail. Given the demand d, we try to evaluate the system reliability that the maximum#ow of the network is
not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then
the system reliability can be calculated in terms of such points. One computer example is shown to illustrate
the solution procedure.
相关搜索： reliability
(系统自动生成,下载前可以参看下载内容)
下载文件列表
On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint.pdf