Indirect covering tree problems on spanning tree networks

DOI10.1016/0377-2217(93)90141-9zbMath0772.90056OpenAlexW2006578777MaRDI QIDQ2368291

Vicki Aaronson Hutson, Charles S. Re Velle

Publication date: 24 August 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90141-9

zbMATH Keywords

spanning treefacility locationtree algorithmsbackbone networkindirect covering treeminimum cost covering subtree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80)

Related Items (5)

Multiobjective transportation network design and routing problems: Taxonomy and annotation ⋮ Facility location with tree topology and radial distance constraints ⋮ A Survey on Multiple Objective Minimum Spanning Tree Problems ⋮ A review of extensive facility location in networks ⋮ Efficient solution methods for covering tree problems

Cites Work

• Multiobjective programming and planning
• Maximal Direct Covering Tree Problems
• A minimum-length covering subtree of a tree

This page was built for publication: Indirect covering tree problems on spanning tree networks