Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems
This paper presents the first investigation on applying a particle swarm optimization (PSO) algorithm to both the Steiner tree problem and the delay constrained multicast routing problem. Steiner tree problems, being the underlining models of many applications, have received significant research att...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
Springer
2013
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/28287/ |