Pages that link to "Item:Q3474491"
From MaRDI portal
The following pages link to Maximal Direct Covering Tree Problems (Q3474491):
Displaying 8 items.
- Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem (Q1270784) (← links)
- A review of extensive facility location in networks (Q1278421) (← links)
- Efficient solution methods for covering tree problems (Q1284598) (← links)
- A unifying location model on tree graphs based on submodularity property (Q1314341) (← links)
- Variable neighborhood tabu search and its application to the median cycle problem. (Q1410620) (← links)
- Multiobjective transportation network design and routing problems: Taxonomy and annotation (Q2368289) (← links)
- Indirect covering tree problems on spanning tree networks (Q2368291) (← links)
- A Survey on Multiple Objective Minimum Spanning Tree Problems (Q3637314) (← links)
