AN ALGORITHM FOR RANKING PATHS THAT MAY CONTAIN CYCLES

被引:56
作者
MARTINS, EDV
机构
关键词
D O I
10.1016/0377-2217(84)90269-8
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:123 / 130
页数:8
相关论文
共 13 条
[1]  
[Anonymous], 1980, NETWORK FLOW PROGRAM
[2]  
CLIMACO JCN, 1981, METHODS OPERATIONS R, V40, P225
[3]  
CLIMACO JCN, 1981, SIMPLEX BASED ALGORI
[4]   SHORTEST-ROUTE METHODS .1. REACHING, PRUNING, AND BUCKETS [J].
DENARDO, EV ;
FOX, BL .
OPERATIONS RESEARCH, 1979, 27 (01) :161-186
[5]  
DIAL R, 1977, CCS291 U TEX AUST CT
[6]   AN APPRAISAL OF SOME SHORTEST-PATH ALGORITHMS [J].
DREYFUS, SE .
OPERATIONS RESEARCH, 1969, 17 (03) :395-&
[8]  
Lawler E.L., 1976, COMBINATORIAL OPTIMI
[9]   PROCEDURE FOR COMPUTING K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO SHORTEST PATH PROBLEM [J].
LAWLER, EL .
MANAGEMENT SCIENCE SERIES A-THEORY, 1972, 18 (07) :401-405
[10]   COMPUTATIONAL EXPERIENCE WITH AN ALGORITHM FOR FINDING K-SHORTEST PATHS IN A NETWORK [J].
SHIER, DR .
JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1974, B 78 (03) :139-165