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):
Displayed 5 items.
- 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)
- On the complexity of graph tree partition problems. (Q1421460) (← links)
- Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem (Q1577113) (← links)
- A mini–max spanning forest approach to the political districting problem (Q3183734) (← links)