FINDING THE MOST VITAL ARCS IN A NETWORK

被引:125
作者
BALL, MO [1 ]
GOLDEN, BL [1 ]
VOHRA, RV [1 ]
机构
[1] OHIO STATE UNIV,FAC MANAGEMENT SCI,COLUMBUS,OH 43210
关键词
D O I
10.1016/0167-6377(89)90003-5
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:73 / 76
页数:4
相关论文
共 8 条
[1]  
Corley H. W., 1982, Operations Research Letters, V1, P157, DOI 10.1016/0167-6377(82)90020-7
[2]   MAXIMIZING MINIMUM SOURCE-SINK PATH SUBJECT TO A BUDGET CONSTRAINT [J].
FULKERSON, DR ;
HARDING, GC .
MATHEMATICAL PROGRAMMING, 1977, 13 (01) :116-118
[3]  
Garey M. R., 1979, COMPUTERS INTRACTABI
[4]  
GOLDEN B, 1978, NAV RES LOG, V25, P711
[5]   THE COMPLEXITY OF FINDING MAXIMUM DISJOINT PATHS WITH LENGTH CONSTRAINTS [J].
ITAI, A ;
PERL, Y ;
SHILOACH, Y .
NETWORKS, 1982, 12 (03) :277-286
[6]  
MALHOTRA VM, 1978, INFORMATION PROCESSI, V7, P227
[7]  
MALIK K, 1983, UNPUB K MOST VITAL L
[8]  
PROVAN JS, 1988, IN PRESS NETWORKDS