|
ヤマグチ カズアキ
Kazuaki Yamaguchi
山口 一章 所属 追手門学院大学 理工学部 情報工学科 職種 教授 |
|
| 言語種別 | 英語 |
| 発行・発表の年月 | 2018/07 |
| 形態種別 | 外国学会誌（その他） |
| 査読 | 査読あり |
| 標題 | A branch-and-bound based exact algorithm for the maximum edge-weight clique problem |
| 執筆形態 | 共著・編著（代表編著を除く） |
| 掲載誌名 | Proceedings of 5th International Conference on Computational Science/ Intelligence & Applied Informatics |
| 出版社・発行元 | International Association for Computer and Information Science |
| 巻・号・頁 | 116(316),pp.63-68 |
| 担当区分 | 責任著者 |
| 著者・共著者 | SHIMIZU SATOSHI,YAMAGUCHI KAZUAKI,MASUDA SUMIO |
| 概要 | The maximum edge-weight clique problem is to find a clique whose sum of edge-weight is maximum for a given edge-weighted undirected graph. The problem is NP-hard and was formulated as a mathematical programming problem in previous studies. In this paper, we propose an exact algorithm based on branch-and-bound. By some computational experiments, we confirmed our proposal algorithm is faster than the methods based on mathematical programming. |
| DOI | 10.1007/978-3-319-96806-3_3 |
| ISSN | 0913-5685 |
| NAID | 40021031805 |
| DBLP ID | conf/csii/ShimizuYM18 |
| PermalinkURL | http://id.ndl.go.jp/bib/027791205 |
| researchmap用URL | http://id.ndl.go.jp/bib/027790781 |