An Efficiency Enhancement of k-opt Local Search Heuristic for Binary Quadratic Programming Problem

スポンサーリンク

概要

• 論文の詳細を見る

• It is known that a parameter of the k-opt local search for the binary quadratic programming problem (BQP) can reduce search times for neighborhoods to some extent. In this paper, we propose a new method to further reduce the search times considerably by analyzing search behaviors for the local search.

• 社団法人電子情報通信学会の論文
• 2002-03-01

著者

• Narihisa Hiroyuki

  Department Of Information And Computer Engineering Okayama University Of Science

• Narihisa Hiroyuki

  Department Of Information & Computer Engineering Faculty Of Engineering Okayama University Of Sc

• KOHMOTO Keiko

  Graduate School of Engineering, Okayama University of Science

• KATAYAMA Kengo

  Department of Information and Computer Engineering, Okayama University of Science

• Kohmoto Keiko

  Graduate School Of Engineering Okayama University Of Science

• Katayama Kengo

  Department Of Information And Computer Engineering Okayama University Of Science

関連論文

• APPROXIMATE METHOD FOR SEPARABLE NONCONVEX PROGRAMS
• Parallel Performance of Ensemble Self-Generating Neural Networks for Chaotic Time Series Prediction Problems
• An Efficiency Enhancement of k-opt Local Search Heuristic for Binary Quadratic Programming Problem

スポンサーリンク