このエントリーをはてなブックマークに追加
ID 25641
file
creator
Ishimatsu, Jun
Nishizaki, Ichiro
Hayashida, Tomohiro
NDC
Technology. Engineering
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.
journal title
Fourth International Workshop on Computational Intelligence & Applications Proceedings : IWCIA 2008
start page
159
end page
164
date of issued
2008-12
publisher
IEEE SMC Hiroshima Chapter
issn
1883-3977
language
eng
nii type
Conference Paper
HU type
Conference Papers
DCMI type
text
format
application/pdf
text version
publisher
rights
(c) Copyright by IEEE SMC Hiroshima Chapter.
department
Graduate School of Engineering



Last 12 months's access : ? times
Last 12 months's DL: ? times


This month's access: ? times
This month's DL: ? times