MINIMUM COST FLOW WITH SET-CONSTRAINTS

被引:50
作者
HASSIN, R
机构
关键词
D O I
10.1002/net.3230120102
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:1 / 21
页数:21
相关论文
共 10 条
[1]  
EDMONDS J, 1970, P CALGARY INT C GORD, P67
[2]  
Edmonds J., 1971, MATH PROGRAM, V1, P127, DOI [10.1007/BF01584082, DOI 10.1007/BF01584082]
[3]  
FUJISHIGE S, 1977, J OPER RES SOC JPN, V20, P1
[4]   POLYMATROIDAL DEPENDENCE STRUCTURE OF A SET OF RANDOM-VARIABLES [J].
FUJISHIGE, S .
INFORMATION AND CONTROL, 1978, 39 (01) :55-72
[5]  
Hassin R, 1978, THESIS YALE U
[6]  
Hoffman A. J., 1960, P S APPL MATH, P113
[7]   ALGORITHM FOR FINDING AN OPTIMAL INDEPENDENT ASSIGNMENT [J].
IRI, M ;
TOMIZAWA, N .
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1976, 19 (01) :32-57
[8]  
Lawler E.L., 1976, COMBINATORIAL OPTIMI
[9]   MATROID INTERSECTION ALGORITHMS [J].
LAWLER, EL .
MATHEMATICAL PROGRAMMING, 1975, 9 (01) :31-56
[10]   NOTE ON PRIMAL-DUAL AND OUT-OF-KILTER ALGORITHMS FOR NETWORK OPTIMIZATION PROBLEMS [J].
SHAPIRO, JF .
NETWORKS, 1977, 7 (01) :81-88