Pages that link to "Item:Q4679783"

The following pages link to Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm (Q4679783):

Displaying 7 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)
• 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)
• The prize-collecting generalized minimum spanning tree problem (Q2476612) (← links)
• A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem (Q6090469) (← links)