The boolean quadratic programming problem with generalized upper bound constraints

•We consider the boolean quadratic programming problem with generalized upper bound constraints (BQP-GUB).•We present various complexity results on the problem along with different metaheuristic algorithms.•Results of extensive experimental analysis are presented demonstrating the efficacy of our proposed algorithms.

We consider the boolean quadratic programming problem with generalized upper bound constraints (BQP-GUB) which subsumes the well-known quadratic semi-assignment problem. BQP-GUB has applications in engineering, production planning and biology. We present various complexity results on the problem along with different metaheuristic algorithms. Results of extensive experimental analysis are presented demonstrating the efficacy of our proposed algorithms.