Local Search for Integer Quadratic Programming
<|reference_start|>Local Search for Integer Quadratic Programming: Integer Quadratic Programming (IQP) is an important problem in operations research. Local search is a powerful method for solving hard problems, but the research on local search algorithms for IQP solving is still on its early stage. This paper develops an efficient local search solver for solving general IQP, called LS-IQCQP. We propose four new local search operators for IQP that can handle quadratic terms in the objective function, constraints or both. Furthermore, a two-mode local search algorithm is introduced, utilizing newly designed scoring functions to enhance the search process. Experiments are conducted on standard IQP benchmarks QPLIB and MINLPLIB, comparing LS-IQCQP with several state-of-the-art IQP solvers. Experimental results demonstrate that LS-IQCQP is competitive with the most powerful commercial solver Gurobi and outperforms other state-of-the-art solvers. Moreover, LS-IQCQP has established 6 new records for QPLIB and MINLPLIB open instances.<|reference_end|>
@article{he2024local,
    title={Local Search for Integer Quadratic Programming},
    author={Xiang He, Peng Lin, Shaowei Cai},
    journal={arXiv preprint arXiv:2409.19668},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.19668},
    primaryClass={cs.AI}
}