Optimal location of single and multiple obnoxious facilities : algorithms for the maximin criterion under different norms
This thesis investigates the computational problem of locating obnoxious (undesirable) facilities in a way that minimizes their effect on a given set of clients (e.g. population centres). Supposing that the undesirable effects of such a facility on a given client are a decreasing function of the dis...
Main Author: | Giannikos, Ioannis |
---|---|
Published: |
London School of Economics and Political Science (University of London)
1993
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.645391 |
Similar Items
-
Locating a semi-obnoxious facility on a network with the elliptic maximin and network minisum objectives
Published: () -
The obnoxious facility location game with dichotomous preferences
by: Li, F., et al.
Published: (2023) -
The planar multiple obnoxious facilities location problem: A Voronoi based heuristic
by: Drezner, Z., et al.
Published: (2019) -
A Study on Multi-Objectives Obnoxious Facility Location Problem
by: Yuan-Ying Chen, et al.
Published: (2010) -
An Algorithm for 4-Median Problem with Obnoxious Facilities In Trees.
by: Fang, Yachun, et al.
Published: (2012)