2010 Volume 130 Issue 6 Pages 1089-1090
In this paper, Iterated Greedy algorithm with K-opt Local Search (IGKLS) is proposed for the binary quadratic programming problem (BQP). The proposed iterated greedy algorithm consists of two central phases, construction and destruction 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.