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

M Colebrook (), J Gutiérrez, S Alonso () and J Sicilia
Additional contact information
M Colebrook: University of La Laguna
J Gutiérrez: University of La Laguna
S Alonso: University of La Laguna
J Sicilia: University of La Laguna

Journal of the Operational Research Society, 2002, vol. 53, issue 12, 1357-1366

Abstract: 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 (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601468 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:53:y:2002:i:12:d:10.1057_palgrave.jors.2601468

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601468

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().