𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data

✍ Scribed by Adam Kasperski, Mariusz Makuchowski, Paweł Zieliński

Book ID
113066406
Publisher
Springer US
Year
2012
Tongue
English
Weight
972 KB
Volume
18
Category
Article
ISSN
1381-1231

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tabu search algorithm for the Capacita
A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
✍ Sharaiha, Yazid M.; Gendreau, Michel; Laporte, Gilbert; Osman, Ibrahim H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 2 views

The Capacitated Shortest Spanning Tree Problem consists of determining a shortest spanning tree in a vertex weighted graph such that the weight of every subtree linked to the root by an edge does not exceed a prescribed capacity. We propose a tabu search heuristic for this problem, as well as dynami