FINDING SHORTEST PATHS IN THE PLANE IN THE PRESENCE OF BARRIERS TO TRAVEL (FOR ANY LP-NORM)

被引:24
作者
VIEGAS, J [1 ]
HANSEN, P [1 ]
机构
[1] UNIV PARIS 09,CNRS,LAMSADE,F-75016 PARIS,FRANCE
关键词
D O I
10.1016/0377-2217(85)90010-4
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:373 / 381
页数:9
相关论文
共 15 条
[1]  
Aho A.V., 1983, DATA STRUCTURES ALGO
[2]  
Dijkstra EW., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390
[3]  
GOLDMAN AJ, 1963, MAA M ANNAPOLIS
[4]   SOME LOCALIZATION THEOREMS FOR A CONSTRAINED WEBER PROBLEM [J].
HANSEN, P ;
PEETERS, D ;
THISSE, JF .
JOURNAL OF REGIONAL SCIENCE, 1981, 21 (01) :103-115
[5]  
HANSEN P, 1981, MANAGE SCI, V28, P1285
[6]  
HART PE, 1968, IEEE T SYS SCI CYBER, V4, P100, DOI DOI 10.1109/TSSC.1968.300136
[7]   SOLUTIONS OF CONSTRAINED LOCATION PROBLEMS [J].
HURTER, AP ;
SCHAEFER, MK ;
WENDELL, RE .
MANAGEMENT SCIENCE, 1975, 22 (01) :51-56
[8]  
Katz N., 1981, EUR J OPER RES, V6, P166
[9]   A DUAL-MODE ROUTING ALGORITHM FOR AN AUTONOMOUS ROVING VEHICLE [J].
KIRK, DE ;
LIM, LY .
IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 1970, AES6 (03) :290-&
[10]   FINDING MINIMUM RECTILINEAR DISTANCE PATHS IN THE PRESENCE OF BARRIERS [J].
LARSON, RC ;
LI, VOK .
NETWORKS, 1981, 11 (03) :285-304