INVESTING IN ARCS IN A NETWORK TO MAXIMIZE THE EXPECTED MAX FLOW

被引：11

作者：

WALLACE, SW

机构：

来源：

关键词：

D O I：

10.1002/net.3230170108

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：87 / 103

页数：17

共 18 条

[1] MAXIMAL EXPECTED FLOW IN A NETWORK SUBJECT TO ARC FAILURES
ANEJA, YP
NAIR, KPK
[J]. NETWORKS, 1980, 10 (01) : 45 - 57
[2] IMPLICIT ENUMERATION SCHEME FOR PROPER CUT GENERATION
BELLMORE, M
JENSEN, PA
[J]. TECHNOMETRICS, 1970, 12 (04) : 775 - &
[3] BIRGE JR, 1983, WP83111 IIASA WORK P
[4] BOUNDS ON EXPECTED PERFORMANCE OF NETWORKS WITH LINKS SUBJECT TO FAILURE
CAREY, M
HENDRICKSON, C
[J]. NETWORKS, 1984, 14 (03) : 439 - 456
[5] Doullize P., 1972, REV FRANCAISE AUTOMA, V3, P45
[6] Evans J. R., 1976, Networks, V6, P161, DOI 10.1002/net.3230060208
[7] Hamacher H., 1982, Operations Research Letters, V1, P186, DOI 10.1016/0167-6377(82)90037-2
[8] Kall P., 1982, Mathematische Operationsforschung und Statistik, Series Optimization, V13, P431, DOI 10.1080/02331938208842805
[9] NETGEN - PROGRAM FOR GENERATING LARGE-SCALE CAPACITATED ASSIGNMENT, TRANSPORTATION, AND MINIMUM COST FLOW NETWORK PROBLEMS
KLINGMAN, D
NAPIER, A
STUTZ, J
[J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1974, 20 (05): : 814 - 821
[10] BOUNDS ON THE EXPECTATION OF A CONVEX FUNCTION OF A MULTIVARIATE RANDOM VARIABLE
MADANSKY, A
[J]. ANNALS OF MATHEMATICAL STATISTICS, 1959, 30 (03): : 743 - 746