OPTIMAL NETWORK CAPACITY PLANNING - SHORTEST-PATH SCHEME

被引:18
作者
DOULLIEZ, PJ
RAO, MR
机构
[1] SOCIET TRACTION & ELECT,BRUSSELS,BELGIUM
[2] UNIV ROCHESTER,ROCHESTER,NY
关键词
D O I
10.1287/opre.23.4.810
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:810 / 818
页数:9
相关论文
共 11 条
[1]  
Bellman R., 1957, DYNAMIC PROGRAMMING
[2]  
Dijkstra E., 1959, NUMER MATH, V1, P269
[3]   CAPACITY OF A NETWORK WITH INCREASING DEMANDS AND ARCS SUBJECT TO FAILURE [J].
DOULLIEZ, PJ ;
RAO, MR .
OPERATIONS RESEARCH, 1971, 19 (04) :905-&
[4]   MAXIMAL FLOW IN A MULTI-TERMINAL NETWORK WITH ANY ONE ARC SUBJECT TO FAILURE [J].
DOULLIEZ, PJ ;
RAO, MR .
MANAGEMENT SCIENCE SERIES A-THEORY, 1971, 18 (01) :48-58
[5]   AN APPRAISAL OF SOME SHORTEST-PATH ALGORITHMS [J].
DREYFUS, SE .
OPERATIONS RESEARCH, 1969, 17 (03) :395-&
[6]  
ERLENKOTTER D, 1969, THESIS STANFORD U
[7]  
FONG CO, 1973, CSS7304 U ROCH GRAD
[8]  
FONG CY, TO BE PUBLISHED
[9]  
MANNE AS, 1967, INVESTMENTS CAPACITY, P178
[10]  
PESCHON J, 1968, POWER SYSTEM PLANNIN