Journal of the Operational Research Society

, Volume 53, Issue 12, pp 1357–1366

A new algorithm for the undesirable 1-center problem on networks

Theoretical Paper

DOI: 10.1057/palgrave.jors.2601468

Cite this article as:
Colebrook, M., Gutiérrez, J., Alonso, S. et al. J Oper Res Soc (2002) 53: 1357. doi:10.1057/palgrave.jors.2601468

Abstract

Recent papers have developed efficient algorithms for the location of an undesirable (obnoxious) 1-center on general networks with n nodes and m edges. Even though the theoretical complexity of these algorithms is fine, the computational time required to get the solution can be diminished using a different model formulation and slightly improving the upper bounds. Thus, we present a new O(mn) algorithm, which is more straightforward and computationally faster than the previous ones. Computing time results comparing the former approaches with the proposed algorithm are supplied.

Keywords

location networks and graphs undesirable (noxious/obnoxious) facility 

Copyright information

© Palgrave Macmillan Ltd 2002

Authors and Affiliations

  • M Colebrook
    • 1
  • J Gutiérrez
    • 1
  • S Alonso
    • 1
  • J Sicilia
    • 1
  1. 1.University of La LagunaSpain

Personalised recommendations