Back to Search
Start Over
A Min-Max Theorem for p-Center Problems on a Tree.
- Source :
-
Transportation Science . Aug77, Vol. 11 Issue 3, p243. 10p. - Publication Year :
- 1977
-
Abstract
- 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 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 equipment to the "dual" problem of locating p + 1 points on the network so as to maximize the minimum distance between pairs of points. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00411655
- Volume :
- 11
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Transportation Science
- Publication Type :
- Academic Journal
- Accession number :
- 5848118
- Full Text :
- https://doi.org/10.1287/trsc.11.3.243