𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tabu search for the BWC problem

✍ Scribed by Daniel Berend, Ephraim Korach, Shira Zucker

Book ID
118802471
Publisher
Springer US
Year
2011
Tongue
English
Weight
343 KB
Volume
54
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Tabu search for the Steiner problem in g
Tabu search for the Steiner problem in graphs
✍ Celso C. Ribeiro; MaurΓ­cio C. De Souza πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 143 KB πŸ‘ 2 views

Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum-weighted subgraph spanning a given subset of nodes (terminals) of the original graph. In this paper, we describe a tabu search algorithm for the Steiner problem in graphs, based o