Discrete particle swarm optimization for the minimum labelling Steiner tree problem

DOI10.1007/s11047-009-9137-9zbMath1206.90136OpenAlexW2007351477MaRDI QIDQ968390

Sergio Consoli, Nenad Mladenović, José Andrés Moreno-Pérez, Kenneth Darby-Dowman

Publication date: 5 May 2010

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: http://bura.brunel.ac.uk/handle/2438/3561

zbMATH Keywords

graphs and networksdiscrete particle swarm optimizationminimum labelling Steiner tree problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (8)

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

Cites Work

• Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
• The minimum labeling spanning trees
• On the minimum label spanning tree problem
• The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
• The Complexity of Computing Steiner Minimal Trees
• Multi-Start Methods
• A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Discrete particle swarm optimization for the minimum labelling Steiner tree problem