A CONTINUOUS-TIME NETWORK SIMPLEX ALGORITHM

被引：39
作者：
ANDERSON, EJ
PHILPOTT, AB
机构：
来源：
NETWORKS | 1989年 / 19卷 / 04期
关键词：
D O I：
10.1002/net.3230190403
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：395 / 425
页数：31
相关论文
共 5 条
[1]  
Anderson E.J., 1983, SIAM J CONTROL OPTIM, V21, P258
[2]   OPTIMAL DYNAMIC ROUTING IN COMMUNICATION-NETWORKS WITH CONTINUOUS TRAFFIC [J].
HAJEK, B ;
OGIER, RG .
NETWORKS, 1984, 14 (03) :457-487
[3]   EXTREME-POINTS AND BASIC FEASIBLE SOLUTIONS IN CONTINUOUS-TIME LINEAR-PROGRAMMING [J].
PEROLD, AF .
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1981, 19 (01) :52-63
[4]  
PHILPOTT AB, 1985, INFINITE PROGRAMMING
[5]   MODELING OF ADAPTIVE ROUTING IN DATA-COMMUNICATION NETWORKS [J].
SEGALL, A .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1977, 25 (01) :85-95
1