Pages that link to "Item:Q2890473"

The following pages link to Heuristic search for the generalized minimum spanning tree problem (Q2890473):

Displaying 21 items.

• Truncated incremental search (Q253972) (← links)
• Generalized minimum spanning tree games (Q286691) (← links)
• 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)
• Greedy heuristics for the diameter-constrained minimum spanning tree problem (Q844529) (← 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)
• 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 rapid learning automata-based approach for generalized minimum spanning tree problem (Q2023120) (← links)
• Scatter search for the minimum leaf spanning tree problem (Q2147145) (← links)
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911) (← links)
• The prize-collecting generalized minimum spanning tree problem (Q2476612) (← links)
• The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search (Q3057152) (← links)
• Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints (Q3466769) (← links)
• Approximation Algorithms for Generalized MST and TSP in Grid Clusters (Q3467839) (← links)
• An average case analysis of the minimum spanning tree heuristic for the power assignment problem (Q5236925) (← links)
• (Q5475932) (← links)
• An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search (Q6070498) (← links)
• Continuous approximation formulas for location problems (Q6085881) (← links)
• A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem (Q6090469) (← links)