| Item type |
デフォルトアイテムタイプ_（フル）(1) |
| 公開日 |
2023-03-18 |
| タイトル |
|
|
タイトル |
An approximate solution method based on tabu search for k-minimum spanning tree problems |
|
言語 |
en |
| 作成者 |
Ishimatsu, Jun
Katagiri, Hideki
Nishizaki, Ichiro
Hayashida, Tomohiro
|
| アクセス権 |
|
|
アクセス権 |
open access |
|
アクセス権URI |
http://purl.org/coar/access_right/c_abf2 |
| 権利情報 |
|
|
権利情報 |
(c) Copyright by IEEE SMC Hiroshima Chapter. |
| 主題 |
|
|
主題Scheme |
NDC |
|
主題 |
500 |
| 内容記述 |
|
|
内容記述 |
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. |
|
言語 |
en |
| 出版者 |
|
|
出版者 |
IEEE SMC Hiroshima Chapter |
| 言語 |
|
|
言語 |
eng |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_5794 |
|
資源タイプ |
conference paper |
| 出版タイプ |
|
|
出版タイプ |
VoR |
|
出版タイプResource |
http://purl.org/coar/version/c_970fb48d4fbd8a85 |
| 収録物識別子 |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
1883-3977 |
| 開始ページ |
|
|
開始ページ |
159 |
| 書誌情報 |
Fourth International Workshop on Computational Intelligence & Applications Proceedings : IWCIA 2008
Fourth International Workshop on Computational Intelligence & Applications Proceedings : IWCIA 2008
p. 159-164,
発行日 2008-12
|
| 旧ID |
25641 |
11-08-PS080004.pdf (425.8 KB)
