Maximal Direct Covering Tree Problems

DOI10.1287/TRSC.23.4.288MaRDI QIDQ3474491zbMATH OpenOpenAlexFDO

Authors Vicki Aaronson Hutson, C. S. Revelle

Publication date 1989

Published in Transportation Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/trsc.23.4.288

zbMATH Keywords

subtreemaximal direct covering tree problemnoninferior set estimation methodspanning tree networktwo-objective integer programming

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Maximal covering tree problems
• On spanning tree problems with multiple objectives
• Optimal direct and indirect covering trees
• Indirect covering tree problems on spanning tree networks
• Efficient solution methods for covering tree problems

Cited in

(13)

• Maximal covering tree problems
• A tree-covering problem arising in integrity of tree-structured data
• Efficient solution methods for covering tree problems
• Optimal direct and indirect covering trees
• Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem
• Variable neighborhood tabu search and its application to the median cycle problem.
• A unifying location model on tree graphs based on submodularity property
• Indirect covering tree problems on spanning tree networks
• Mixed covering of trees and the augmentation problem with odd diameter constraints
• A review of extensive facility location in networks
• A Survey on Multiple Objective Minimum Spanning Tree Problems
• Multiobjective transportation network design and routing problems: Taxonomy and annotation
• The anchored network covering problem

This page was built for publication: Maximal Direct Covering Tree Problems

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