Work

Inductive linearization for binary quadratic programs with linear constraints

Year: 2020
Type: article
Abstract: A linearization technique for binary quadratic programs (BQPs) that comprise linear constraints is presented. The technique, called “inductive linearization”, extends concepts for BQPs with particular equation constraints, that have been referred to as “compact linearization” before, to the general case. Quadratic terms may occur in the objective function, in the set of constraints, or in both. For several relevant applications, the linear programming relaxations obtained from applying the technique are proven to be at least as strong as the one obtained with a well-known classical linearization. It is also shown how to obtain an inductive linearization automatically. This might be used, e.g., by general-purpose mixed-integer programming solvers.
Source: 4OR
Author: Sven Mallach
Institution: University of Bonn
Language: English
Open Access status: hybrid
Estimated APC paid: $2,750
OpenAlex ID: W3092976014
FWCI: 0.708
Cites: 38
Cited by: 6
Related to: 8