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

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

0.00 Avg rating0 Votes
Article ID: iaor20032034
Country: United Kingdom
Volume: 53
Issue: 12
Start Page Number: 1357
End Page Number: 1366
Publication Date: Dec 2002
Journal: Journal of the Operational Research Society
Authors: , , ,
Keywords: obnoxious facilities
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.

Reviews

Required fields are marked *. Your email address will not be published.