Article ID: | iaor20082185 |
Country: | United Kingdom |
Volume: | 34 |
Issue: | 5 |
Start Page Number: | 1491 |
End Page Number: | 1514 |
Publication Date: | May 2007 |
Journal: | Computers and Operations Research |
Authors: | Sicilia Joaqun, Colebrook Marcos |
Keywords: | networks, programming: multiple criteria |
This paper is devoted to the location of undesirable facilities on multicriteria networks. Firstly, we analyze the undesirable center and median models establishing new properties to characterize the efficient solutions and rules to remove inefficient edges. Then, by means of a convex combination of these two latter functions, we address the λ-anti-cent-dian problem providing an effective rule to remove inefficient edges as well as a polynomial algorithm that solves the problem. Finally, we also comment on how this model can be slightly modified to generalize other models presented in the literature.