A STRONGLY POLYNOMIAL MINIMUM COST CIRCULATION ALGORITHM

被引:173
作者
TARDOS, E [1 ]
机构
[1] RES INST TELECOMMUN,H-1026 BUDAPEST,HUNGARY
关键词
D O I
10.1007/BF02579369
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:247 / 255
页数:9
相关论文
共 14 条
[1]  
[Anonymous], 1970, SOVIET MATH DOKL
[2]  
ANSTEE RP, 1983, CORR8322 U WAT RES R
[3]   A PRIMAL-DUAL ALGORITHM FOR SUBMODULAR FLOWS [J].
CUNNINGHAM, WH ;
FRANK, A .
MATHEMATICS OF OPERATIONS RESEARCH, 1985, 10 (02) :251-262
[4]   SYSTEMS OF DISTINCT REPRESENTATIVES AND LINEAR ALGEBRA [J].
EDMONDS, J .
JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1967, B 71 (04) :241-+
[5]   THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J].
EDMONDS, J ;
KARP, RM .
JOURNAL OF THE ACM, 1972, 19 (02) :248-&
[6]  
Edmonds J., 1975, ANN DISCRETE MATH, V1, P185
[7]  
EDMONDS J, 1970, COMBINATORIAL STRUCT, P67
[8]  
Ford L., 1962, FLOWS NETWORKS
[9]   AN OUT-OF-KILTER METHOD FOR MINIMAL-COST FLOW PROBLEMS [J].
FULKERSON, DR .
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1961, 9 (01) :18-27
[10]   FACTORING POLYNOMIALS WITH RATIONAL COEFFICIENTS [J].
LENSTRA, AK ;
LENSTRA, HW ;
LOVASZ, L .
MATHEMATISCHE ANNALEN, 1982, 261 (04) :515-534