Pages that link to "Item:Q817552"
From MaRDI portal
The following pages link to Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552):
Displaying 8 items.
- 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)
- A two-level solution approach for solving the generalized minimum spanning tree problem (Q1681269) (← links)
- A rapid learning automata-based approach for generalized minimum spanning tree problem (Q2023120) (← links)
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911) (← links)
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
- Heuristic search for the generalized minimum spanning tree problem (Q2890473) (← links)
- Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm (Q4679783) (← links)