Discrete particle swarm optimization for the minimum labelling Steiner tree problem
type: Item
instance of: scholarly article
title: Discrete particle swarm optimization for the minimum labelling Steiner tree problem
zbMATH Open document ID: 1206.90136
author: S. Consoli
author: José A. Moreno Pérez
author: Nenad Mladenović
author: Ken Darby-Dowman
published in: Natural Computing
publication date: 2010-05-05T00:00:00Z
full work available at URL: http://bura.brunel.ac.uk/handle/2438/3561
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5703930
zbMATH Keywords: discrete particle swarm optimization
zbMATH Keywords: minimum labelling Steiner tree problem
zbMATH Keywords: graphs and networks
MaRDI profile type: Publication
OpenAlex ID: W2007351477
cites work: The minimum labeling spanning trees
cites work: Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
cites work: Q3093335
cites work: The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
cites work: A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings
cites work: The Complexity of Computing Steiner Minimal Trees
cites work: Q4704222
cites work: On the minimum label spanning tree problem
cites work: Multi-Start Methods
cites work: Q4207565
cites work: Q4945803
DOI: 10.1007/S11047-009-9137-9
description: scientific article; zbMATH DE number 5703930