EFFICIENT SHORTEST-PATH SIMPLEX ALGORITHMS

被引：20
|
作者：
GOLDFARB, D [1 ]
HAO, JX [1 ]
KAI, SR [1 ]
机构：
[1] GTE LABS INC, WALTHAM, MA 02254 USA
来源：
OPERATIONS RESEARCH | 1990年 / 38卷 / 04期
关键词：
D O I：
10.1287/opre.38.4.624
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
We consider the specialization of the primal simplex algorithm to the problem of finding a tree of directed shortest paths from a given node to all other nodes in a network of n nodes or finding a directed cycle of negative length. Two efficient variants of this shortest path simplex algorithm are analyzed and shown to require at most (n - 1)(n - 2)/2 pivots and O(n3) time.
引用
收藏
页码：624 / 628
页数：5
相关论文
共 50 条
12345