Pages that link to "Item:Q1278250"
From MaRDI portal
The following pages link to A heuristic algorithm for the mini-max spanning forest problem (Q1278250):
Displaying 11 items.
- Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem (Q319778) (← links)
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm (Q486731) (← links)
- Political districting: From classical models to recent approaches (Q657583) (← links)
- Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector (Q723499) (← links)
- 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)
- On the complexity of graph tree partition problems. (Q1421460) (← links)
- Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem (Q1577113) (← links)
- Combinatorial approximation algorithms for the maximum bounded connected bipartition problem (Q2111532) (← links)
- Political districting: from classical models to recent approaches (Q2393445) (← links)
- A mini–max spanning forest approach to the political districting problem (Q3183734) (← links)
