𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem

✍ Scribed by Sergio Consoli; José Andrés Moreno-Pérez; Kenneth Darby-Dowman; Nenad Mladenović

Publisher
Springer Netherlands
Year
2009
Tongue
English
Weight
279 KB
Volume
9
Category
Article
ISSN
1567-7818

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Discrete particle swarm optimization bas
Discrete particle swarm optimization based on estimation of distribution for terminal assignment problems
✍ Jiahai Wang; Yiqiao Cai; Yalan Zhou; Ronglong Wang; Caiwei Li 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 294 KB

## a b s t r a c t Terminal assignment problem (TEAP) is to determine minimum cost links to form a network by connecting a given set of terminals to a given collection of concentrators. This paper presents a novel discrete particle swarm optimization (PSO) based on estimation of distribution (EDA)