A minimum-length covering subtree of a tree
- 1 April 1990
- journal article
- research article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 37 (2) , 309-326
- https://doi.org/10.1002/1520-6750(199004)37:2<309::aid-nav3220370209>3.0.co;2-8
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A minimum length covering subgraph of a networkAnnals of Operations Research, 1989
- The optimal location of a path or tree in a tree networkNetworks, 1985
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median ProblemsManagement Science, 1983
- Locational analysisEuropean Journal of Operational Research, 1983
- Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree NetworkOperations Research, 1982
- A note on a nonlinear minimax location problem in tree networksJournal of Research of the National Bureau of Standards, 1977
- Minimax location problems with nonlinear costsJournal of Research of the National Bureau of Standards, 1977
- Convex Location Problems on Tree NetworksOperations Research, 1976
- A Minimax Location Problem on a NetworkTransportation Science, 1974