Investing in arcs in a network to maximize the expected max flow
作者:
Stein W. Wallace,
期刊:
Networks
(WILEY Available online 1987)
卷期:
Volume 17,
issue 1
页码: 87-103
ISSN:0028-3045
年代: 1987
DOI:10.1002/net.3230170108
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractConsider a network with arcs subject to failures. We show how the problem of investing in new arcs in such a network in order to increase the expected max flow as much as possible can be formulated as a stochastic program with network recourse. We show how to decompose the problem, and consider both exact methods and approximations. Convergence proofs are given. We demonstrate that max flow recourse problems can be solved very efficiently, since lower and upper bounds are equally simple to evaluate.
点击下载:
PDF
(808KB)
返 回