MINIMUM-DELAY ROUTING IN CONTINUOUS-TIME DYNAMIC NETWORKS WITH PIECEWISE-CONSTANT CAPACITIES

被引：26

作者：

OGIER, RG

机构：

来源：

NETWORKS | 1988年 / 18卷 / 04期

关键词：

D O I：

10.1002/net.3230180405

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：303 / 318

页数：16

共 13 条

[1] A CLASS OF CONTINUOUS NETWORK FLOW PROBLEMS [J].

ANDERSON, EJ ;

NASH, P ;

PHILPOTT, AB .

MATHEMATICS OF OPERATIONS RESEARCH, 1982, 7 (04) :501-514

[2]

Ford L., 1962, FLOWS NETWORKS

[3] OPTIMAL DYNAMIC ROUTING IN COMMUNICATION-NETWORKS WITH CONTINUOUS TRAFFIC [J].

HAJEK, B ;

OGIER, RG .

NETWORKS, 1984, 14 (03) :457-487

[4]

JODORKOVSKY M, 1979, EE PUBL TECHNION ISR, V358

[5] O(V3) ALGORITHM FOR FINDING MAXIMUM FLOWS IN NETWORKS [J].

MALHOTRA, VM ;

KUMAR, MP ;

MAHESHWARI, SN .

INFORMATION PROCESSING LETTERS, 1978, 7 (06) :277-278

[6] MAXIMAL, LEXICOGRAPHIC, AND DYNAMIC NETWORK FLOWS [J].

MINIEKA, E .

OPERATIONS RESEARCH, 1973, 21 (02) :517-527

[7] AN OPTIMAL-CONTROL APPROACH TO DYNAMIC ROUTING IN NETWORKS [J].

MOSS, FH ;

SEGALL, A .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1982, 27 (02) :329-339

[8]

MOSS FH, 1977, MIT ESLR721 EL SYST

[9]

OGIER RG, 1983, 1983 P C INF SCI SYS, P565

[10]

Papadimitriou C. H., 1998, COMBINATORIAL OPTIMI

← 1 2 →