A benchmark generator for boolean quadratic programming
Numerical Analysis
2021-03-16 v3
Abstract
For boolean quadratic programming (BQP), we will show that there is no duality gap between the primal and dual problems under some conditions by using the classical Lagrangian duality. A benchmark generator is given to create random BQP problems which can be solved in polynomial time. Several numerical examples are generated to demonstrate the effectiveness of the proposed method.
Cite
@article{arxiv.1406.4812,
title = {A benchmark generator for boolean quadratic programming},
author = {Xiaojun Zhou},
journal= {arXiv preprint arXiv:1406.4812},
year = {2021}
}
Comments
4 pages