You are not currently logged in.
Access JSTOR through your library or other institution:
A New Algorithm for the Undesirable 1-Center Problem on Networks
M. Colebrook, J. Gutiérrez, S. Alonso and J. Sicilia
The Journal of the Operational Research Society
Vol. 53, No. 12 (Dec., 2002), pp. 1357-1366
Stable URL: http://www.jstor.org/stable/822725
Page Count: 10
You can always find the topics here!Topics: Algorithms, Distance functions, Maximin, Operations research, Objective functions, Property lines, Linear programming, Fall lines, Vertices, Maximum value
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
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.
The Journal of the Operational Research Society © 2002 Operational Research Society