Pages that link to "Item:Q5928213"

The following pages link to A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy (Q5928213):

Displayed 8 items.

• Metaheuristics in combinatorial optimization (Q817206) ‎ (← links)
• Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems (Q2226969) ‎ (← links)
• The rainbow Steiner tree problem (Q2669791) ‎ (← links)
• Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) ‎ (← links)
• A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure (Q3025048) ‎ (← links)
• Randomized heuristics for the Max-Cut problem (Q4405937) ‎ (← links)
• Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic (Q6066592) ‎ (← links)
• Metaheuristics: A Canadian Perspective (Q6102854) ‎ (← links)