Pages that link to "Item:Q2267296"

The following pages link to Variable neighbourhood search for the minimum labelling Steiner tree problem (Q2267296):

Displaying 11 items.

• The label cut problem with respect to path length and label frequency (Q313969) (← links)
• Solving the minimum label spanning tree problem by mathematical programming techniques (Q666399) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• On the complexity of rainbow spanning forest problem (Q1749772) (← links)
• A hybrid metaheuristic for the minimum labeling spanning tree problem (Q1755227) (← links)
• The rainbow spanning forest problem (Q1797922) (← links)
• Two heuristics for the rainbow spanning forest problem (Q2184043) (← links)
• Variable neighbourhood search for the \(k\)-labelled spanning forest problem (Q2631224) (← links)
• The rainbow Steiner tree problem (Q2669791) (← links)
• Comparison of metaheuristics for the <i>k</i>‐labeled spanning forest problem (Q5278227) (← links)
• Finding minimum label spanning trees using cross‐entropy method (Q6065862) (← links)