SHORTEST-PATH FOREST WITH TOPOLOGICAL ORDERING - AN ALGORITHM DESCRIPTION IN SDL

被引：8

作者：

DIAL, R

GLOVER, F

KARNEY, D

KLINGMAN, D

机构：

[1] UNIV COLORADO,BOULDER,CO 80309

[2] UNIV TEXAS,AUSTIN,TX 78712

来源：

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL | 1980年 / 14卷 / 04期

关键词：

D O I：

10.1016/0191-2615(80)90014-4

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

引用

收藏

页码：343 / 347

页数：5

相关论文

共 5 条

[1]

DIAL R, 1977, CCS291 U TEX AUST CT

[2] SHORTEST-PATH FOREST WITH TOPOLOGICAL ORDERING [J].

DIAL, RB .

COMMUNICATIONS OF THE ACM, 1969, 12 (11) :632-&

[3]

Glover F., 1974, INFOR. Canadian Journal of Operational Research and Information Processing, V12, P293

[4]

Knuth, 2010, COMBINATORIAL ALGORI, V4

[5]

Pape U., 1974, Mathematical Programming, V7, P212, DOI 10.1007/BF01585517