Pages that link to "Item:Q319778"
From MaRDI portal
The following pages link to Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem (Q319778):
Displaying 4 items.
- Solving the 2-rooted mini-max spanning forest problem by branch-and-bound (Q1043334) (← links)
- A branch-and-bound algorithm for the mini-max spanning forest problem (Q1278942) (← links)
- Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem (Q1577113) (← links)
- Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts (Q3013056) (← links)