A NETWORK FLOW COMPUTATION FOR PROJECT COST CURVES

被引:210
作者
FULKERSON, DR
机构
关键词
D O I
10.1287/mnsc.7.2.167
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:167 / 178
页数:12
相关论文
共 8 条
[1]  
Ford L. R., 1956, CAN J MATH, V8, P399, DOI [10.4153/CJM-1956-045-5, DOI 10.4153/CJM-1956-045-5]
[2]   CONSTRUCTING MAXIMAL DYNAMIC FLOWS FROM STATIC FLOWS [J].
FORD, LR ;
FULKERSON, DR .
OPERATIONS RESEARCH, 1958, 6 (03) :419-433
[3]  
Ford LR., 1957, CAN J MATH, V9, P210, DOI [10.4153/CJM-1957-024-0, DOI 10.4153/CJM-1957-024-0]
[4]   INCREASING THE CAPACITY OF A NETWORK - THE PARAMETRIC BUDGET PROBLEM [J].
FULKERSON, DR .
MANAGEMENT SCIENCE, 1959, 5 (04) :472-483
[5]  
FULKERSON DR, 1959, RAND P1825 CORP PAP
[6]  
Kelley James E., 1959, CRITICAL PATH PLANNI
[7]  
KELLEY JE, 1960, IN PRESS OPERATIONS
[8]  
KELLEY JE, 1959, IN PRESS 1959 P E JO