Name
Abstract | ||
|---|---|---|
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 dynamic data structures developed to speed up the algorithm. Computational results on new randomly generated instances and on instances taken from the literature indicate that the proposed approach produces high-quality solutions within reasonable computing times. (C) 1997 John Wiley & Sons, Inc. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1002/(SICI)1097-0037(199705)29:3<161::AID-NET4>3.0.CO;2-F | NETWORKS |
Keywords | Field | DocType |
Capacitated shortest spanning tree,tabu search | Capacitated minimum spanning tree,Mathematical optimization,Combinatorics,Search algorithm,Distributed minimum spanning tree,Algorithm,Spanning tree,Shortest-path tree,Tabu search,Mathematics,Kruskal's algorithm,Minimum spanning tree | Journal |
Volume | Issue | ISSN |
29 | 3 | 0028-3045 |
Citations | PageRank | References |
39 | 3.83 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yazid M. Sharaiha | 1 | 121 | 10.86 |
| Michel Gendreau | 2 | 6609 | 393.98 |
| Gilbert Laporte | 3 | 8666 | 612.13 |
| Ibrahim H. Osman | 4 | 815 | 94.23 |