OPTIMAL OBNOXIOUS PATHS ON A NETWORK - TRANSPORTATION OF HAZARDOUS MATERIALS

被引：173
作者：
BATTA, R [1 ]
CHIU, SS [1 ]
机构：
[1] STANFORD UNIV,DEPT ENGN ECON SYST,STANFORD,CA 94305
来源：
OPERATIONS RESEARCH | 1988年 / 36卷 / 01期
关键词：
NETWORKS - Networks - OPTIMAL OBNOXIOUS PATHS - Optimal Obnoxious Paths - Shortest-Path Algorithm;
D O I：
10.1287/opre.36.1.84
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
(Edited Abstract)
引用
收藏
页码：84 / 92
页数：9
相关论文
共 35 条
[1]   EVACUATION RISKS - A TENTATIVE APPROACH FOR QUANTIFICATION [J].
BASTIEN, MC ;
DUMAS, M ;
LAPORTE, J ;
PARMENTIER, N .
RISK ANALYSIS, 1985, 5 (01) :53-61
[2]   OPTIMAL SERVER LOCATION ON A NETWORK OPERATING AS AN M/G/1 QUEUE [J].
BERMAN, O ;
LARSON, RC ;
CHIU, SS .
OPERATIONS RESEARCH, 1985, 33 (04) :746-771
[3]   OPTIMAL PATH OF A SINGLE SERVICE UNIT ON A NETWORK TO A NONEMERGENCY DESTINATION [J].
BERMAN, O ;
RAHNAMA, MR .
TRANSPORTATION SCIENCE, 1983, 17 (02) :218-231
[4]  
BERMAN O, 1985, TRANSPORT SCI, V21, P115
[5]  
BRANDEAU ML, 1985, ANN OPNS RES, V6, P223
[6]  
BROGAN JD, 1985, 1020 NAT RES COUNC T, P19
[7]   EUCLIDEAN DISTANCE LOCATION-ALLOCATION PROBLEMS WITH UNIFORM DEMANDS OVER CONVEX POLYGONS [J].
CAVALIER, TM ;
SHERALI, HD .
TRANSPORTATION SCIENCE, 1986, 20 (02) :107-116
[8]  
CAVALIER TM, 1983, ORSA TIMS M ORLANDO
[9]   OPTIMAL M-G-1 SERVER LOCATION ON A TREE NETWORK WITH CONTINUOUS LINK DEMANDS [J].
CHIU, SS .
COMPUTERS & OPERATIONS RESEARCH, 1986, 13 (06) :653-669
[10]   THE MINISUM LOCATION PROBLEM ON AN UNDIRECTED NETWORK WITH CONTINUOUS LINK DEMANDS [J].
CHIU, SS .
COMPUTERS & OPERATIONS RESEARCH, 1987, 14 (05) :369-383
1234