Pages that link to "Item:Q1278942"
From MaRDI portal
The following pages link to A branch-and-bound algorithm for the mini-max spanning forest problem (Q1278942):
Displaying 14 items.
- Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem (Q319778) (← links)
- An exact algorithm for the knapsack sharing problem with common items (Q817562) (← links)
- Solving the 2-rooted mini-max spanning forest problem by branch-and-bound (Q1043334) (← links)
- A heuristic algorithm for the mini-max spanning forest problem (Q1278250) (← links)
- A greedy heuristic for a minimum-weight forest problem (Q1317004) (← links)
- On the complexity of graph tree partition problems. (Q1421460) (← links)
- Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem (Q1577113) (← links)
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257) (← links)
- A class of heuristics for the constrained forest problem (Q2581555) (← links)
- Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts (Q3013056) (← links)
- A branch and bound algorithm for the capacitated minimum spanning tree problem (Q3141109) (← links)
- A mini–max spanning forest approach to the political districting problem (Q3183734) (← links)
- Balanced spanning forests and trees (Q3984286) (← links)
- Approximating minimum \(k\)-tree cover of a connected graph inspired by the multi-ferry routing in delay tolerant networks (Q6629668) (← links)
