𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Variable neighbourhood search for the minimum labelling Steiner tree problem

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

Publisher
Springer US
Year
2009
Tongue
English
Weight
599 KB
Volume
172
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tabu search heuristic for the Steiner
A tabu search heuristic for the Steiner Tree Problem
✍ Gendreau, Michel; Larochelle, Jean-Francois; Sans�, Brunilde 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 342 KB 👁 2 views

The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has regained attention due to the introduction of new telecommunication technologies, such as ATM, since it appears as the inherent mathematical structure behind multicast communications. In this paper, we present a tabu se