A LINEAR-PROGRAMMING MODEL FOR DESIGN OF COMMUNICATIONS NETWORKS WITH TIME-VARYING PROBABILISTIC DEMANDS

被引:6
作者
KORTANEK, KO
LEE, DN
POLAK, GG
机构
关键词
D O I
10.1002/nav.3800280102
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
20
引用
收藏
页码:1 / 32
页数:32
相关论文
共 19 条
[1]  
CHARNES A, 1961, MANAGEMENT MODELS IN, V1
[2]  
Cooper R. B., 1972, INTRO QUEUEING THEOR
[3]   ANALYTIC APPROXIMATION OF BLOCKING PROBABILITIES IN CIRCUIT SWITCHED COMMUNICATION NETWORKS [J].
DESCHAMPS, PJ .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1979, 27 (03) :603-606
[4]  
EISENBERG M, 1977, AT&T TECH J, V56, P1
[5]   DESCENT ALGORITHM FOR MULTIHOUR SIZING OF TRAFFIC NETWORKS [J].
ELSNER, WB .
BELL SYSTEM TECHNICAL JOURNAL, 1977, 56 (08) :1405-1430
[6]  
Gnedenko B. V., 1966, INTRO QUEUEING THEOR
[7]   AN APPLICATION OF GENERALIZED LINEAR PROGRAMMING TO NETWORK FLOWS [J].
GOMORY, RE ;
HU, TC .
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1962, 10 (02) :260-283
[8]   MULTI-TERMINAL NETWORK FLOWS [J].
GOMORY, RE ;
HU, TC .
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1961, 9 (04) :551-570
[9]   SYNTHESIS OF A COMMUNICATION NETWORK [J].
GOMORY, RE ;
HU, TC .
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1964, 12 (02) :348-369
[10]   OPTIMAL-DESIGN AND UTILIZATION OF COMMUNICATION-NETWORKS [J].
KALABA, RE ;
JUNCOSA, ML .
MANAGEMENT SCIENCE, 1956, 3 (01) :33-44