Pages that link to "Item:Q325465"
From MaRDI portal
The following pages link to The tree-star problem: a formulation and a branch-and-cut algorithm (Q325465):
Displaying 7 items.
- The solutions of two star-height problems for regular trees (Q760212) (← links)
- An algorithmic framework for the exact solution of tree-star problems (Q1753556) (← links)
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem (Q2329685) (← links)
- The complete optimal stars-clustering-tree problem (Q2473041) (← links)
- A new formulation for spanning trees (Q2840708) (← links)
- On the Optimal Stars Clustering Tree Problem (Q3439552) (← links)
- Branch‐and‐cut algorithms for the ‐arborescence star problem (Q6071060) (← links)