Pages that link to "Item:Q2329685"
From MaRDI portal
The following pages link to Mixed-integer programming approaches for the tree \(t^*\)-spanner problem (Q2329685):
Displaying 5 items.
- The tree-star problem: a formulation and a branch-and-cut algorithm (Q325465) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Exact approaches for the minimum subgraph diameter problem (Q2108148) (← links)
- General variable neighborhood search for the minimum stretch spanning tree problem (Q6063503) (← links)
- Polynomial algorithms for sparse spanners on subcubic graphs (Q6621853) (← links)