A benchmark generator for boolean quadratic programming
From MaRDI portal
Publication:6512010
DOI10.1109/CAC51589.2020.9326828arXiv1406.4812MaRDI QIDQ6512010FDOQ6512010
Authors: Xiaojun Zhou 
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.
This page was built for publication: A benchmark generator for boolean quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6512010)
