LS-IQCQP

LS-IQCQP is a Local Search solver for large scale Integer QP problem.

Author: XiangHe and Shaowei Cai

Local Search is an incomplete algorithm that continuously improves the quality of solutions through a finite number of iterations within a cutoff time. After the cutoff period, it outputs the found optimal objective function value and solution set.

Publication and Code

The paper, titled “Local Search for Integer Quadratic Programming,” describes the LS-IQCQP solver, including its local search framework, operator design, and experimental performance, and has been accepted by INFORMS Journal on Computing.

The source code is publicly available at:

https://github.com/INFORMSJoC/2025.1178