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