A CAPACITY-ROUNDING ALGORITHM FOR THE MINIMUM-COST CIRCULATION PROBLEM - A DUAL FRAMEWORK OF THE TARDOS ALGORITHM

被引：31
作者：
FUJISHIGE, S
机构：
来源：
MATHEMATICAL PROGRAMMING | 1986年 / 35卷 / 03期
关键词：
D O I：
10.1007/BF01580882
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：298 / 308
页数：11
相关论文
共 10 条
[1]  
[Anonymous], 1970, SOVIET MATH DOKL
[2]   A PRIMAL-DUAL ALGORITHM FOR SUBMODULAR FLOWS [J].
CUNNINGHAM, WH ;
FRANK, A .
MATHEMATICS OF OPERATIONS RESEARCH, 1985, 10 (02) :251-262
[3]   THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J].
EDMONDS, J ;
KARP, RM .
JOURNAL OF THE ACM, 1972, 19 (02) :248-&
[4]  
Edmonds J., 1975, ANN DISCRETE MATH, V1, P185
[5]  
Ford L., 1962, FLOWS NETWORKS
[6]  
IRI M, 1969, NETWORK FLOW TRANSPO
[7]  
Lawler E.L., 1976, COMBINATORIAL OPTIMI
[8]  
ORLIN JB, 1984, MIT161584 AP SLOAN S
[9]  
ROCK H, 1980, DISCRETE STRUCTURES, P00181
[10]  
TARDOS E, 1985, UNPUB COMBINATORICA
1