Pages that link to "Item:Q968390"

The following pages link to Discrete particle swarm optimization for the minimum labelling Steiner tree problem (Q968390):

Displaying 8 items.

• Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem (Q1702134) (← links)
• On the complexity of rainbow spanning forest problem (Q1749772) (← links)
• A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems (Q1753628) (← links)
• The rainbow spanning forest problem (Q1797922) (← links)
• Two heuristics for the rainbow spanning forest problem (Q2184043) (← links)
• Minimum label \(s\)-\(t\) cut has large integrality gaps (Q2216106) (← links)
• A new approach for solving set covering problem using jumping particle swarm optimization method (Q2311260) (← links)
• The rainbow Steiner tree problem (Q2669791) (← links)