A minimum length covering subgraph of a network
- 1 December 1989
- journal article
- section iv-discrete-and-network-location-problems
- Published by Springer Nature in Annals of Operations Research
- Vol. 18 (1) , 245-259
- https://doi.org/10.1007/bf02097806
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The location of central structures in treesComputers & Operations Research, 1988
- The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation NetworksTransportation Science, 1987
- Optimal Minimax Path of a Single Service Unit on a Network to Nonservice DestinationsTransportation Science, 1987
- The hierarchical network design problemEuropean Journal of Operational Research, 1986
- The maximum covering/shortest path problem: A multiobjective network design and routing formulationEuropean Journal of Operational Research, 1985
- Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location ProblemsJournal of the ACM, 1984
- SYMPOSIUM ON LOCATION PROBLEMS: IN MEMORY OF LEON COOPERJournal of Regional Science, 1984
- Linear Algorithms for Finding the Jordan Center and Path Center of a TreeTransportation Science, 1981
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- A note on two problems in connexion with graphsNumerische Mathematik, 1959