Discrete particle swarm optimization for the minimum labelling Steiner tree problem

DOI10.1007/S11047-009-9137-9zbMATH Open1206.90136OpenAlexW2007351477MaRDI QIDQ968390FDOQ968390

Authors: S. Consoli, José A. Moreno Pérez, Nenad Mladenović, Ken 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

Recommendations

• scientific article; zbMATH DE number 2159383
• A discrete particle swarm optimization algorithm
• A particle swarm optimization approach to the multi level capacitated minimum spanning tree problem
• scientific article; zbMATH DE number 5811277
• A survey on discrete particle swarm optimization algorithms

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)

Cites Work

• Statistical comparisons of classifiers over multiple data sets
• Title not available (Why is that?)
• On the minimum label spanning tree problem
• The Complexity of Computing Steiner Minimal Trees
• The minimum labeling spanning trees
• The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
• Multi-Start Methods
• A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings
• Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• A new approach for solving set covering problem using jumping particle swarm optimization method
• A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems
• On the complexity of rainbow spanning forest problem
• The rainbow spanning forest problem
• A particle swarm optimization approach to the multi level capacitated minimum spanning tree problem
• 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
• Variable neighbourhood search for the minimum labelling Steiner tree problem
• Minimum label \(s\)-\(t\) cut has large integrality gaps

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968390)