论文信息 - A Min-Max Theorem for p-Center Problems on a Tree

A Min-Max Theorem for p-Center Problems on a Tree

This paper considers the problem of locating p facilities on a tree network in order to minimize the maximum distance from a point on the network to its nearest facility. Such a problem might arise, for example, in optimally locating a fixed number of fire hydrants along a street network. The present, paper identifies an underlying min-max theorem that governs such a p -center problem. More specifically, this p-center problem is shown to be equivalent to the “dual” problem of locating p + 1 points on the network so as to maximize the minimum distance between pairs of points.

D. Shier

[1] S. L. Hakimi,et al. Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[2] E. Minieka. The m-Center Problem , 1970 .

[3] A. J. Goldman. Minimax Location of a Facility in a Network , 1972 .

[4] G. Handler. Minimax Location of a Facility in an Undirected Tree Graph , 1973 .

[5] Gabriel Y. Handler,et al. Minimax network location : theory and algorithms , 1974 .

[6] R. L. Francis,et al. A Minimax Location Problem on a Network , 1974 .

[7] J. Moon,et al. Relations between packing and covering numbers of a tree , 1975 .

[8] P. M. Dearing. Minimax location problems with nonlinear costs , 1977 .

[9] Richard L. Francis. A Note on a Nonlinear Minimax Location Problem in Tree Networks. , 1977, Journal of research of the National Bureau of Standards.