The expropriation location problem

被引：15

作者：

Berman, O

Drezner, Z

Wesolowsky, GO

机构：

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

[2] Calif State Univ Fullerton, Fullerton, CA 92834 USA

[3] McMaster Univ, Hamilton, ON, Canada

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 2003年 / 54卷 / 07期

基金：

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

关键词：

obnoxious locations; covering problems; partial demand; budget constraints; expropriation;

D O I：

10.1057/palgrave.jors.2601548

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, we consider the location of a new obnoxious facility that serves only a certain proportion of the demand. Each demand point can be bought by the developer at a given price. An expropriation budget is given. Demand points closest to the facility are expropriated within the given budget. The objective is to maximize the distance to the closest point not expropriated. The problem is formulated and polynomial algorithms are proposed for its solution both on the plane and on a network.

引用

页码：769 / 776

页数：8

共 10 条

[1] The generalized maximal covering location problem [J].