A benchmark generator for boolean quadratic programming
classification
🧮 math.NA
cs.NA
keywords
benchmarkbooleandualitygeneratorproblemsprogrammingquadraticclassical
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.