OPTIMAL PATH OF A SINGLE SERVICE UNIT ON A NETWORK TO A NONEMERGENCY DESTINATION

被引:14
作者
BERMAN, O [1 ]
RAHNAMA, MR [1 ]
机构
[1] UNIV CALGARY,CALGARY T2N 1N4,ALBERTA,CANADA
关键词
D O I
10.1287/trsc.17.2.218
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:218 / 231
页数:14
相关论文
共 16 条
[1]   DEVELOPMENTS IN NETWORK LOCATION WITH MOBILE AND CONGESTED FACILITIES [J].
BERMAN, O ;
LARSON, RC ;
ODONI, AR .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1981, 6 (02) :104-116
[2]   THE MEDIAN PROBLEM WITH CONGESTION [J].
BERMAN, O ;
LARSON, RC .
COMPUTERS & OPERATIONS RESEARCH, 1982, 9 (02) :119-126
[3]  
BERMAN O, 1979, UNPUB INFOR
[4]   RESPONSE AREAS FOR 2 EMERGENCY UNITS [J].
CARTER, GM ;
CHAIKEN, JM .
OPERATIONS RESEARCH, 1972, 20 (03) :571-&
[5]   ALGORITHM FOR THE M-MEDIAN PLANT LOCATION PROBLEM. [J].
Garfinkel, R.S. ;
Neebe, A.W. ;
Rao, M.R. .
Transportation Science, 1974, 8 (03) :217-236
[6]  
GASS S, 1968, 23RD P NAT C ASS COM
[8]  
HANDLER G. Y., 1979, LOCATION NETWORKS
[9]  
HESS SW, 1965, OPNS RES, V13, P462
[10]  
IGNALL E, 1971, WW7561NYC NEW YORK C