The expropriation location problem |
| |
| Authors: | O Berman Z Drezner G O Wesolowsky |
| |
| Affiliation: | 1.University of Toronto,Canada;2.California State University-Fullerton,Fullerton,USA;3.McMaster University,Hamilton,Canada |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
