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 18 items.

• On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706) (← links)
• Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552) (← links)
• A tabu search heuristic for the generalized minimum spanning tree problem (Q933503) (← links)
• Solving the 2-rooted mini-max spanning forest problem by branch-and-bound (Q1043334) (← 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)
• A global optimization algorithm for solving the minimum multiple ratio spanning tree problem (Q2392120) (← 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)
• The generalized minimum spanning tree: polyhedra and branch-and-cut (Q2741333) (← links)
• A branch and bound algorithm for the capacitated minimum spanning tree problem (Q3141109) (← links)
• (Q3638643) (← links)
• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm (Q4458720) (← links)
• (Q5314095) (← links)
• (Q5392237) (← links)
• (Q5475932) (← links)
• A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem (Q6090469) (← links)