Pages that link to "Item:Q1420439"

The following pages link to Solving group Steiner problems as Steiner problems. (Q1420439):

Displaying 14 items.

• Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552) (← links)
• 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)
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem (Q953318) (← links)
• Combinatorial optimization in system configuration design (Q1027725) (← links)
• SCIP-Jack -- a solver for STP and variants with parallelization extensions (Q1699618) (← links)
• Solving the \(k\)-cardinality assignment problem by transformation (Q1877052) (← 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)
• Some formulations for the group Steiner tree problem (Q2500536) (← links)
• General variable neighborhood search approach to group Steiner tree problem (Q6063507) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
• A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem (Q6090469) (← links)