DESIGN OF MULTIPOINT LINKAGES IN A TELEPROCESSING TREE NETWORK

被引：43
作者：
CHANDY, KM
RUSSEL, RA
机构：
来源：
IEEE TRANSACTIONS ON COMPUTERS | 1972年 / C 21卷 / 10期
关键词：
D O I：
10.1109/T-C.1972.223452
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：1062 / &
相关论文
共 12 条
[1]  
CHANDY KM, UNPUBLISHED
[2]  
Dantzig G.B., 1963, LINEAR PROGRAMMING
[3]  
Dijkstra E.W., 1959, NUMER MATH, V1, P269, DOI [DOI 10.1007/BF01386390, /10.1007/BF01386390]
[4]   ON TELEPROCESSING SYSTEM DESIGN .2. A METHOD FOR APPROXIMATING OPTIMAL NETWORK [J].
ESAU, LR ;
WILLIAMS, KC .
IBM SYSTEMS JOURNAL, 1966, 5 (03) :142-+
[5]  
Ford Lester R., 1962, FLOWS NETWORKS
[6]  
GRAY P, 1971, OPER RES, V19, P15
[7]  
Hu T.C., 1969, INTEGER PROGRAMMING
[8]   AN ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM [J].
LITTLE, JDC ;
MURTY, KG ;
SWEENEY, DW ;
KAREL, C .
OPERATIONS RESEARCH, 1963, 11 (06) :972-989
[9]  
Martin J., 1967, DESIGN REAL TIME COM
[10]  
MURTY K, 1968, OPER RES
12