Indirect covering tree problems on spanning tree networks

DOI10.1016/0377-2217(93)90141-9MaRDI QIDQ2368291zbMATH OpenOpenAlexFDO

Authors Vicki Aaronson Hutson, C. S. Revelle

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

backbone networkfacility locationindirect covering treeminimum cost covering subtreespanning treetree algorithms

Mathematics Subject Classification ID

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

Recommendations

• Optimal direct and indirect covering trees
• Maximal covering tree problems
• Maximal Direct Covering Tree Problems
• Efficient solution methods for covering tree problems

Cites work

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

Cited in

(8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368291)