Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

岡山理科大学紀要. A, 自然科学

Simple Enhancements of Local Search Methods for the Binary Quadratic Programming Problem

謙吾 片山, 洋之 成久

Published Jan 1, 2001• 0 citations
OpenAlex

Related papers

Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming

Peter Merz, Bernd Freisleben

Journal of Heuristics•Mar 1, 2002•152 citations

Combining Discrete Ellipsoid-Based Search and Branch-and-Cut for Binary Quadratic Programming Problems

Wen-Yang Ku, J. Christopher Beck

Lecture notes in computer science•Jan 1, 2014•4 citations

A scatter search approach to unconstrained quadratic binary programs

Mohammad M. Amini, Bahram Alidaee, Gary A. Kochenberger

McGraw-Hill Ltd., UK eBooks•Jan 1, 1999•48 citations

Solution Methods for General Quadratic Programming Problem with Continuous and Binary Variables: Overview

Nguyen Van Thoai

Studies in computational intelligence•Jan 1, 2013•6 citations

Systems Analysis; Solving unconstrained binary quadratic programming problem by global equilibrium search

Vladimir P. Shylo, Oleg V. Shylo

Cybernetics and Systems Analysis•Nov 1, 2011•9 citations

An iterated greedy algorithm for the binary quadratic programming problem

Fubito Toyama, Kenji Shoji, Hiroshi Mori +1 more

The binary quadratic programming problem (BQP) is an NP-hard problem and has a large number of applications. In this paper, an iterated greedy algorithm with k-opt local search (IGKLS) is proposed for the BQP. Iterated greedy (IG) algorithm has already been applied to a variety of optimization problems, and shown to be simple but with excellent search performance. The proposed iterated greedy algorithm consists of two central phases, destruction and construction phases. As a local search algorithm, k-opt local search is applied after the construction phase. The computational results showed that the proposed iterated greedy algorithm outperformed state-of-the-art methods for huge size BQP instances.

Joint International Conference on Soft Computing and Intelligent Systems and International Symposium on Advanced Intelligent Systems (SCIS&ISIS)•Nov 1, 2012•5 citations
The binary quadratic programming problem (BQP) is an NP-hard problem and has a large number of applications. In this paper, an iterated greedy algorithm with k-opt local search (IGKLS) is proposed for the BQP. Iterated greedy (IG) algorithm has already been applied to a variety of optimization problems, and shown to be simple but with excellent search performance. The proposed iterated greedy algorithm consists of two central phases, destruction and construction phases. As a local search algorithm, k-opt local search is applied after the construction phase. The computational results showed that the proposed iterated greedy algorithm outperformed state-of-the-art methods for huge size BQP instances.