An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- 1 December 1979
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 37 (3) , 539-560
- https://doi.org/10.1137/0137041
Abstract
Summary:In this paper we show that in a tree with vertex weights the vertices with the second smallest status and those with the second smallest branch-weight are the sameKeywords
This publication has 16 references indexed in Scilit:
- An Algorithmic Approach to Network Location Problems. I: Thep-CentersSIAM Journal on Applied Mathematics, 1979
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate AlgorithmsManagement Science, 1977
- Optimum Locations of Centers in NetworksOperations Research, 1972
- Technical Note—A Branch-and-Bound Algorithm for Seeking the P-MedianOperations Research, 1972
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Optimal Center Location in Simple NetworksTransportation Science, 1971
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted GraphOperations Research, 1968
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic ProblemsOperations Research, 1965
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a GraphOperations Research, 1964