Pages that link to "Item:Q6071060"
From MaRDI portal
The following pages link to Branch‐and‐cut algorithms for the ‐arborescence star problem (Q6071060):
Displaying 3 items.
- The complete optimal stars-clustering-tree problem (Q2473041) (← links)
- A branch-and-cut for the Non-Disjoint<i>m</i>-Ring-Star Problem (Q5418011) (← links)
- An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search (Q6070498) (← links)