Article ID Journal Published Year Pages File Type
5128396 Operations Research Letters 2016 4 Pages PDF
Abstract

Glover's linearization technique is revisited for solving the binary quadratic programming problem with a budget constraint (BBQP). When compared with the recent two linearizations for (BBQP), it not only provides a tighter relaxation at the root node, but also has a much better computational performance for globally solving (BBQP).

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On linearization techniques for budget-constrained binary quadratic programming problems
Authors
, , ,