Pages that link to "Item:Q2575572"
From MaRDI portal
The following pages link to A new relaxation method for the generalized minimum spanning tree problem (Q2575572):
Displayed 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)
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Q621685) (← links)
- An improved hybrid ant-local search algorithm for the partition graph coloring problem (Q747914) (← links)
- A tabu search heuristic for the generalized minimum spanning tree problem (Q933503) (← links)
- The tree of hubs location problem (Q1039782) (← links)
- The prize-collecting generalized minimum spanning tree problem (Q2476612) (← links)
- A new rule for source connection problems (Q2514781) (← links)