首页   按字顺浏览 期刊浏览 卷期浏览 On the Maximum Expected Flow in a Network
On the Maximum Expected Flow in a Network

 

作者: SanchoN. G. F.,  

 

期刊: Journal of the Operational Research Society  （Taylor Available online 1988）
卷期: Volume 39, issue 5  

页码: 481-485

 

ISSN:0160-5682

 

年代: 1988

 

DOI:10.1057/jors.1988.82

 

出版商: Taylor&Francis

 

关键词: Capacity;Dynamic Programming;Maximum Flow;Reliability

 

数据来源: Taylor

 

摘要:

AbstractConsider a graphGin which every arc (i, j) has two numbers,ρijandcij, associated with it representing the reliability and capacity of the arc respectively. It is shown that the expected flow is equal to the sum of the expected capacities of the paths from source to sink. An algorithm is described to find the maximum expected flow in the network.

 

点击下载:  PDF (2765KB)



返 回