A tabu search heuristic for the Steiner
✍
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