obnoxious facility location
Recently Published Documents


TOTAL DOCUMENTS

20
(FIVE YEARS 0)

H-INDEX

6
(FIVE YEARS 0)

2018 ◽  
Vol 1 (2) ◽  
Author(s):  
Utpal Kumar Bhattacharya

 In this paper k-obnoxious facility location problem has been modeled as a pure planner location problem.  Area restriction concept has been incorporated by inducting a convex polygon in the constraints set. A linear programming iterative algorithm for k- obnoxious facility locations has been developed. An upper bound has been incorporated in the algorithm to get the  optimal solution. Also the concept of upper bound has reduced  the number of linear programming problems to solved in the algorithm. Rectilinear distance norm has been considered as the distance measure as it is more appropriate to the various realistic situations. 


2014 ◽  
Vol 61 (1) ◽  
pp. 205-217 ◽  
Author(s):  
P. M. Ortigosa ◽  
E. M. T. Hendrix ◽  
J. L. Redondo

Sign in / Sign up

Export Citation Format

Share Document