Name
Title | ||
|---|---|---|
An approximate solution method based on tabu search for k-minimum spanning tree problems |
Abstract | ||
|---|---|---|
This paper considers a new tabu search-based approximate solution algorithm for k-minimum spanning tree problems. One of the features of the proposed algorithm is that it efficiently obtains local optimal solutions without applying minimum spanning tree algorithms. Numerical experimental results show that the proposed method provides a good performance especially for dense graphs in terms of solution accuracy over existing algorithms. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1504/IJKESDP.2010.035908 | IJKESDP |
Keywords | Field | DocType |
tabu search,new tabu,dense graph,tree problem,approximate solution algorithm,good performance,solution accuracy,tree algorithm,obtains local optimal solution,approximate solution method,proposed algorithm,minimum spanning tree | Mathematical optimization,Distributed minimum spanning tree,k-minimum spanning tree,Prim's algorithm,Euclidean minimum spanning tree,Artificial intelligence,Spanning tree,Kruskal's algorithm,Reverse-delete algorithm,Machine learning,Mathematics,Minimum spanning tree | Journal |
Volume | Issue | Citations |
2 | 3 | 4 |
PageRank | References | Authors |
0.56 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hideki Katagiri | 1 | 436 | 46.48 |
| Tomohiro Hayashida | 2 | 29 | 11.56 |
| Ichiro Nishizaki | 3 | 443 | 42.37 |
| Jun Ishimatsu | 4 | 6 | 0.93 |