The following pages link to (Q4448919):
Displaying 8 items.
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems (Q316168) (← links)
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem (Q342101) (← links)
- The geometric generalized minimum spanning tree problem with grid clustering (Q882648) (← links)
- A tabu search heuristic for the generalized minimum spanning tree problem (Q933503) (← links)
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem (Q953318) (← links)
- On the prize-collecting generalized minimum spanning tree problem (Q2480209) (← links)
- A new relaxation method for the generalized minimum spanning tree problem (Q2575572) (← links)
- Approximation Algorithms for Generalized MST and TSP in Grid Clusters (Q3467839) (← links)