MINIMUM-COST FLOWS IN CONVEX-COST NETWORKS

被引:20
作者
HU, TC
机构
来源
NAVAL RESEARCH LOGISTICS QUARTERLY | 1966年 / 13卷 / 01期
关键词
D O I
10.1002/nav.3800130102
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
引用
收藏
页码:1 / &
相关论文
共 11 条
[1]  
BEALE EML, 1959, NAV RES LOG, V6, P43
[2]  
BIRKHOFF G, 1956, QUARTERLY APPLIED MA, V8
[3]  
BUSACKER RG, 1961, 15 OP RES OFF TECHN
[4]  
COURANT R, 1950, CONFORMAL MAPPING MI
[5]  
DENNIS JB, 1959, MATHEMATICAL PROGRAM
[6]  
Ford Jr L.R., 1956, NETWORK FLOW THEORY
[7]  
Ford Lester R., 1962, FLOWS NETWORKS
[8]   CONSTRUCTING MAXIMAL DYNAMIC FLOWS FROM STATIC FLOWS [J].
FORD, LR ;
FULKERSON, DR .
OPERATIONS RESEARCH, 1958, 6 (03) :419-433
[9]   INCREASING THE CAPACITY OF A NETWORK - THE PARAMETRIC BUDGET PROBLEM [J].
FULKERSON, DR .
MANAGEMENT SCIENCE, 1959, 5 (04) :472-483
[10]  
HU TC, TO APPEAR