Pages that link to "Item:Q4679783"
From MaRDI portal
The following pages link to Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm (Q4679783):
Displaying 4 items.
- A tabu search heuristic for the generalized minimum spanning tree problem (Q933503) (← links)
- A two-level metaheuristic for the all colors shortest path problem (Q1616945) (← links)
- A two-level solution approach for solving the generalized minimum spanning tree problem (Q1681269) (← links)
- A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem (Q6090469) (← links)
