FINDING MINIMUM RECTILINEAR DISTANCE PATHS IN THE PRESENCE OF BARRIERS

被引:74
作者
LARSON, RC [1 ]
LI, VOK [1 ]
机构
[1] UNIV SO CALIF,LOS ANGELES,CA 90007
关键词
D O I
10.1002/net.3230110307
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:285 / 304
页数:20
相关论文
共 9 条
[1]  
Damm E., 1977, Angewandte Informatik, V19, P213
[2]  
Dijkstra EW., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390
[3]   AN APPRAISAL OF SOME SHORTEST-PATH ALGORITHMS [J].
DREYFUS, SE .
OPERATIONS RESEARCH, 1969, 17 (03) :395-&
[4]   ALGORITHM-97 - SHORTEST PATH [J].
FLOYD, RW .
COMMUNICATIONS OF THE ACM, 1962, 5 (06) :345-345
[5]  
LOZANOPEREZ T, 1978, IBM RC7171 TJ WATS R
[6]  
VACCARO H, 1974, THESIS MASSACHUSETTS
[7]  
WANGDAHL G E, 1974, J SHIP RES, V18, P44
[8]   A THEOREM ON BOOLEAN MATRICES [J].
WARSHALL, S .
JOURNAL OF THE ACM, 1962, 9 (01) :11-&
[9]  
WONG T, 1979, THESIS MASSACHUSETTS