ID | 14824 |
Eprint ID | 14824
|
FullText URL | |
Author |
Ishimatsu Jun
Katagiri Hideki
Nishizaki Ichiro
Hayashida Tomohiro
|
Abstract | This paper considers k-minimum spanning tree
problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving procedure of minimum spanning tree (MST) problems for subgraphs to obtain a local optimal solution of k-minimum spanning tree problems. This article provides a new tabu-searchbased approximate solution method that does not iteratively solve minimum spanning tree problems. Results of numerical experiments show that the proposed method provides a good performance in terms of accuracy over those of existing methods for relatively high cardinality k.
|
Published Date | 2008-12-11
|
Publication Title |
Proceedings : Fourth International Workshop on Computational Intelligence & Applications
|
Volume | volume2008
|
Issue | issue1
|
Publisher | IEEE SMC Hiroshima Chapter
|
Start Page | 159
|
End Page | 164
|
ISSN | 1883-3977
|
Content Type |
Conference Paper
|
language |
English
|
Event Title | Fourth International Workshop on Computational Intelligence & Applications IEEE SMC Hiroshima Chapter : IWCIA 2008
|
Event Location | 東広島市
|
Event Location Alternative | Higashi-Hiroshima City
|
File Version | publisher
|
Refereed |
True
|
Eprints Journal Name | IWCIA
|