2000 - Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm
1999 - Iterated Local Search Approach using Genetic Transformation to the Traveling Salesman Problem
全件表示
論文 (67件)：
Kazuho KANAHARA, Kengo KATAYAMA, Etsuji TOMITA. Speeding-Up Construction Algorithms for the Graph Coloring Problem. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 2022. E105.A. 9. 1241-1251
Kazuho Kanahara, Tetsuya Oda, Elis Kulla, Akira Uejima, Kengo Katayama. An Efficient Local Search for the Maximum Clique Problem on Massive Graphs. Lecture Notes on Data Engineering and Communications Technologies. 2022. 118. 201-211
Aoto Hirata, Tetsuya Oda, Nobuki Saito, Tomoya Yasunaga, Kengo Katayama, Leonard Barolli. A Delaunay Edge and CCM-Based SA Approach for Mesh Router Placement Optimization in WMN: A Case Study for Evacuation Area in Okayama City. Lecture Notes on Data Engineering and Communications Technologies. 2022. 118. 346-356
Chihiro Yukawa, Tetsuya Oda, Nobuki Saito, Aoto Hirata, Tomoya Yasunaga, Kyohei Toyoshima, Kengo Katayama. Design of a Robot Vision System for Microconvex Recognition. Lecture Notes on Data Engineering and Communications Technologies. 2022. 118. 366-374
Chihiro Yukawa, Tetsuya Oda, Nobuki Saito, Aoto Hirata, Tomoya Yasunaga, Kyohei Toyoshima, Kengo Katayama. Design of a Robot Vision System for Microconvex Recognition. ADVANCES IN INTERNET, DATA & WEB TECHNOLOGIES (EIDWT-2022). 2022. 118. 366-374
An Effective Local Search for the Maximum Clique Problem. Proc. of the 5th Metaheuristics International Conference (MIC-2003), Kyoto, Japan. 2003
Empirical Knowledge of a Parameter Setting in κ-opt Local Search for the Binary Quadratic Programming Problem. Proc. of the IJCAI-01 Workshop on Empirical Methods in Artificial Intelligence. 2001. 21-26
