FINDING FEASIBLE VECTORS OF EDMONDS-GILES POLYHEDRA

被引:37
作者
FRANK, A [1 ]
机构
[1] RES INST TELECOMMUN,H-1026 BUDAPEST 2,HUNGARY
关键词
D O I
10.1016/0095-8956(84)90029-7
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:221 / 239
页数:19
相关论文
共 26 条
[1]  
[Anonymous], 1970, SOVIET MATH DOKL
[2]  
CUNNINGHAM WH, 1984, J COMBIN THEORY B, V36
[3]  
CUNNINGHAM WH, MATH OPER RES
[4]   THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J].
EDMONDS, J ;
KARP, RM .
JOURNAL OF THE ACM, 1972, 19 (02) :248-&
[5]  
EDMONDS J, 1979, ANN DISCRETE MATH, V4, P39
[6]  
Edmonds J., 1970, COMBINATORIAL STRUCT, P69
[7]  
Edmonds J., 1975, ANN DISCRETE MATH, V1, P185
[8]  
Ford L. R., 1962, FLOWS NETWORKS
[9]  
FRANK A, 1979, ACTA SCI MATH, V41, P63
[10]   A WEIGHTED MATROID INTERSECTION ALGORITHM [J].
FRANK, A .
JOURNAL OF ALGORITHMS, 1981, 2 (04) :328-336