A note on the location of an obnoxious facility on a network

被引：19

作者：

Berman, O

Drezner, Z ^{[1
]}

机构：

[1] Calif State Univ Fullerton, Dept Management Sci Informat Syst, Fullerton, CA 92834 USA

[2] Univ Toronto, Joseph L Rotman Sch Management, Toronto, ON M5S 3E6, Canada

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2000年 / 120卷 / 01期

基金：

加拿大自然科学与工程研究理事会;

关键词：

obnoxious facility; location; network; maximin problem;

D O I：

10.1016/S0377-2217(98)00237-9

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：215 / 217

页数：3

共 12 条

[1]

[Anonymous], 1975, P 16 ANN IEEE S FDN

[2]

Church R. L., 1978, Transportation Science, V12, P107, DOI 10.1287/trsc.12.2.107

[3]

Dreyfus S. E., 1977, MATH SCI ENG, V130

[4] THE LOCATION OF AN OBNOXIOUS FACILITY WITH RECTANGULAR DISTANCES [J].

DREZNER, Z ;

WESOLOWSKY, GO .

JOURNAL OF REGIONAL SCIENCE, 1983, 23 (02) :241-248

[5] LOCATION OF MULTIPLE OBNOXIOUS FACILITIES [J].

DREZNER, Z ;

WESOLOWSKY, GO .

TRANSPORTATION SCIENCE, 1985, 19 (03) :193-202

[6] ANALYTICAL MODELS FOR LOCATING UNDESIRABLE FACILITIES [J].

ERKUT, E ;

NEUMAN, S .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 40 (03) :275-291

[7] ALGORITHM-97 - SHORTEST PATH [J].

FLOYD, RW .

COMMUNICATIONS OF THE ACM, 1962, 5 (06) :345-345

[8]

Hansen P., 1981, SISTEMI URBANI, V3, P299

[9] FINITE DOMINATING SETS FOR NETWORK LOCATION-PROBLEMS [J].

HOOKER, JN ;

GARFINKEL, RS ;

CHEN, CK .

OPERATIONS RESEARCH, 1991, 39 (01) :100-118

[10] LINEAR-TIME ALGORITHMS FOR LINEAR-PROGRAMMING IN R3 AND RELATED PROBLEMS [J].

MEGIDDO, N .

SIAM JOURNAL ON COMPUTING, 1983, 12 (04) :759-776

← 1 2 →